Timeline for Generalizations of the four-color theorem
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 8, 2014 at 8:59 | comment | added | Delio Mugnolo | well, it was not meant as a generalization. while it is known that the chromatic number gives a lower bound for the choosability number, the choosability number cannot be bounded from above by a function of the chromatic number, so they are indeed two different objects. i mentioned thomassen's theorem simply as a related result. | |
| Dec 8, 2014 at 8:54 | comment | added | Delio Mugnolo | ...who found it in 1996, when she was 19 years old. | |
| Dec 8, 2014 at 1:15 | review | Low quality posts | |||
| Dec 8, 2014 at 2:22 | |||||
| Dec 8, 2014 at 1:14 | comment | added | Tony Huynh | But, there are planar graphs that are not 4-choosable (incidentally, I think the smallest known example is due to recent Fields' medalist Maryam Mirzakhani), so this generalization is false. | |
| S Dec 8, 2014 at 0:58 | history | answered | Delio Mugnolo | CC BY-SA 3.0 | |
| S Dec 8, 2014 at 0:58 | history | made wiki | Post Made Community Wiki by Delio Mugnolo |