Spectral and size conditions for spanning k-trees in tough graphs

Siyuan Liang, Tao Tian

The toughness of a graph is a crucial parameter for characterizing its structural properties. The toughness of a non-complete graph $G$ is defined as $τ(G) = \min \{ \dfrac{|S|}{c…