Tutte relations, TQFT, and planarity of cubic graphs
Ian Agol, Vyacheslav Krushkal

TL;DR
This paper explores how Tutte's relations and TQFT methods can characterize planarity in cubic graphs, extending known polynomial properties and proposing new conjectures for planarity criteria.
Contribution
It introduces a planarity criterion based on Tutte's flow polynomial relation at specific values and generalizes bounds on chromatic polynomials using TQFT techniques.
Findings
A planarity criterion for 3-connected cubic graphs using Tutte's flow polynomial relation.
Generalization of Tutte's upper bound on chromatic polynomials to Beraha numbers.
An exponential lower bound for the flow polynomial at (3−√5)/2.
Abstract
It has been known since the work of Tutte that the value of the chromatic polynomial of planar triangulations at has a number of remarkable properties. We investigate to what extent Tutte's relations characterize planar graphs. A version of the Tutte linear relation for the flow polynomial at is shown to give a planarity criterion for -connected cubic graphs. A conjecture is formulated that the golden identity for the flow polynomial characterizes planarity of cubic graphs as well. In addition, Tutte's upper bound on the chromatic polynomial of planar triangulations at is generalized to other Beraha numbers, and an exponential lower bound is given for the value at . The proofs of these results rely on the structure of the Temperley-Lieb algebra and more generally on methods of topological quantum field theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
