Sub-exponentially many 3-colorings of triangle-free planar graphs

Arash Asadi, Zdenek Dvorak, Luke Postle +1

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-coloring…