finding an spanning tree with many leaves when degrees are at least 3
Source: 239 2001 S8
May 19, 2020
graph theorycombinatoricsspanning tree
Problem Statement
Assume that the connected graph has vertices all with degree at least three. Prove that there exists a spanning tree of with more than leaves.