Spanning trees with few branch vertices

Louis DeBiasio, Allan Lo

A branch vertex in a tree is a vertex of degree at least three. We prove that, for all $s\ge 1$, every connected graph on $n$ vertices with minimum degree at least $(\frac{1}{s+3}…