Spanning trees with many leaves: lower bounds in terms of number of vertices of degree 1, 3 and at least~4
Abstract
We prove that every connected graph with s vertices of degree~1 and 3 and t vertices of degree at least~4 has a spanning tree with at least 1 3t +1 4s+3 2 leaves. We present infinite series of graphs showing that our bound is tight.
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.