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 | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jan 6, 2012 at 19:50 | answer | added | j.c. | timeline score: 1 | |
| Jan 6, 2012 at 17:04 | comment | added | Matt Brin | I was too vague and perhaps even misusing the phrase 4-coloring. My ignorance shows here. Let us stick to valence three graphs and let the 4-colorings refer to the face colorings. Now in the dual triangulation, the 4-colorings refer to vertex colorings. Let the dual triangulation have no repeated edges. In fact let the dual triangulation be subject to Whitney's theorem and have a Hamiltonian circuit (and sill have no repeated edges). So we do have two triangulated n-gons glued along the boundaries. Is there anything known (references?) about this more restricted setting? | |
| Jan 6, 2012 at 16:11 | answer | added | Matthew Kahle | timeline score: 0 | |
| Jan 6, 2012 at 15:50 | answer | added | Ian Agol | timeline score: 1 | |
| Jan 6, 2012 at 14:13 | history | asked | Matt Brin | CC BY-SA 3.0 |