Timeline for Is there a "knot theory" for graphs?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Aug 21, 2017 at 17:38 | comment | added | Peter Heinig | Just to add some hearsay, yet research-related hearsay: I recently heard it claimed that is is an open problem as of today what smallest $c\in\mathbb{N}$ makes the (non-first-order) sentence 'Every knotless abstract finite undirected simple graph $G$ is $c$-colorable.' true. It seems known for half a century that $c\leq 8$. Moreover, it seems to be known, too, that $c>5$. Yet it seems an open problem whether the statement is true with $c=6$. Again, I am reporting hearsay here, and did not stop to search for this particular problem in the literature. And whether this is "theory" is debatable. | |
| Oct 30, 2011 at 20:41 | history | edited | Sergey Melikhov | CC BY-SA 3.0 |
deleted 201 characters in body
|
| Oct 30, 2011 at 20:28 | history | answered | Sergey Melikhov | CC BY-SA 3.0 |