Recognition: unknown
Sub-exponentially many 3-colorings of triangle-free planar graphs
classification
🧮 math.CO
keywords
coloringsdistinctleastmanyplanartriangle-freeconjecturedevery
read the original abstract
Thomassen conjectured that every triangle-free planar graph on n vertices has exponentially many 3-colorings, and proved that it has at least 2^[n^(1/12)/20000] distinct 3-colorings. We show that it has at least 2^sqrt(n/362) distinct 3-colorings.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.