Timeline for Maximum number of different 4-colorings of planar graphs of a given size
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 6, 2012 at 18:40 | history | edited | Ian Agol | CC BY-SA 3.0 |
added 293 characters in body
|
| Jan 6, 2012 at 18:06 | comment | added | Igor Rivin | @Ian: yes, I know the Whitney theorem (it was used by Dillencourt and Smith to show that any graph whose dual is a four-connected planar triangulation is the one-skeleton of an inscribed convex polyhedron, based on my oevre...) Anyway, I wonder what the sharp upper bound is in general?! | |
| Jan 6, 2012 at 16:58 | comment | added | Ian Agol | @ Igor: I forgot the condition about no separating triangles. This was proved by Whitney - see the link in the revision. Thanks. | |
| Jan 6, 2012 at 16:57 | history | edited | Ian Agol | CC BY-SA 3.0 |
Correction
|
| Jan 6, 2012 at 16:35 | comment | added | Igor Rivin | Why are planar triangulations Hamiltonian? | |
| Jan 6, 2012 at 15:50 | history | answered | Ian Agol | CC BY-SA 3.0 |