Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs

Thomassen conjectured that every triangle-free planar graph has exponentially many 3-colorings. He proved that it has at least 2n1/12/20000 distinct 3-colorings where n is the number of vertices. We show that it has at least 3-colorings.