Graphs with full rank 3-color matrix and few 3-colorings

We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomial in the number of vertices.

• Type: Journal
• Year: 2008
• Where: JCT
• Authors: Serguei Norine, Jean-Sébastien Sereni
• Keywords: Column Rank, Conjecture, Distinct 3-colorings, JCT 2008