Galen E. Turner III
Published 2003-07-09Version 1
Dirac proved that any graph with minimum vertex degree $\delta$ contains either a cycle of length at least $2\delta$ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than $2\delta$.
Discrepancies of Spanning Trees and Hamilton Cycles
Matchings and Hamilton Cycles with Constraints on Sets of Edges
Matchings in 3-uniform hypergraphs
![QR code for arXiv:math/0307123 [math.CO]](http://oss.arxitics.com/images/favicon.svg)