Timeline for answer to Generalizations of the four-color theorem by Hao Chen
Current License: CC BY-SA 3.0
Post Revisions
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Feb 7, 2015 at 0:50 | history | edited | Kristal Cantwell | CC BY-SA 3.0 |
removed reference to a statement removed because of error
|
| Feb 6, 2015 at 21:57 | history | edited | Hao Chen | CC BY-SA 3.0 |
added 326 characters in body
|
| Dec 8, 2014 at 8:17 | comment | added | Hao Chen | @NoahS Yes, it's arbitrarily high. See arxiv.org/abs/math/0106095 . So it is known that they are not the same. | |
| Dec 8, 2014 at 8:09 | comment | added | Hao Chen | @NoahS, This could be arbitrarily high, isn't it? | |
| Dec 8, 2014 at 1:05 | comment | added | Noah Schweber | Is it known whether this is the same as the chromatic number of maps whose regions are convex subsets of $\mathbb{R}^d$? | |
| Dec 7, 2014 at 23:34 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| Dec 7, 2014 at 18:26 | history | edited | Hao Chen | CC BY-SA 3.0 |
added 1158 characters in body
|
| Dec 7, 2014 at 18:20 | history | edited | Hao Chen | CC BY-SA 3.0 |
added 1158 characters in body
|
| Dec 7, 2014 at 18:15 | history | edited | Hao Chen | CC BY-SA 3.0 |
added 1158 characters in body
|
| Dec 7, 2014 at 16:21 | history | answered | Hao Chen | CC BY-SA 3.0 |