Counting graphs with different numbers of spanning trees through the counting of prime partitions
Abstract
Let An (n >= 1) be the set of all integers x such that there exists a connected graph on n vertices with precisely x spanning trees. In this paper, we show that |An| grows faster than sqrtnexp(2Pi*sqrtn/logn/Sqrt(3) This settles a question of Sedlacek.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.