Spanning trees and continued fractions
Abstract
We prove the exponential growth of the cardinality of the set of numbers of spanning trees in simple (and planar) graphs on n vertices, answering a question of Sedl\'acek from 1969. The proof uses a connection with continued fractions, ``thin orbits,'' and Zaremba's conjecture.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.