Spanning Trees of Simple Planar Graphs
Spanning Trees of Simple Planar Graphs
-
A. Kontorovich, Rutgers & Princeton
We prove the exponential growth of the cardinality of the set of numbers of spanning trees in simple planar graphs on n vertices, answering a question from 1969. The proof uses a connection with continued fractions and advances towards Zaremba’s conjecture. This is joint work with Swee Hong Chan and Igor Pak