Dirac subgraphs of powers of cycles are Hamiltonian
classification
🧮 math.CO
keywords
cyclevarepsilonasymptoticallyconjecturecontainscyclesdegreedirac
read the original abstract
We show that, for every $\varepsilon>0$ and all sufficiently large $k$, any spanning subgraph of the $k$th power of a cycle with minimum degree at least $(1+\varepsilon)k$ contains a Hamilton cycle. This asymptotically settles a conjecture of Espuny D\'iaz, Lichev, and Wesolek.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.