combinatorics / Graph theory
Espuny Diaz, Lichev and Wesolek conjectured that a Dirac-type minimum degree condition forces Hamiltonicity in spanning subgraphs of cycle powers. Asymptotically true: for every $\varepsilon > 0$ and all large $k$, any spanning subgraph of the $k$th power of a cycle with minimum degree at least $(1+\varepsilon)k$ has a Hamilton cycle.
Temporal state
No reconciled state yet.
Append-only history
asymptotic in k; the paper also shows the analogous statement is false for d = 2
Research memory
Espuny Diaz, Lichev and Wesolek conjectured that a Dirac-type minimum degree condition forces Hamiltonicity in spanning subgraphs of cycle powers. Asymptotically true: for every $\varepsilon > 0$ and all large $k$, any spanning subgraph of the $k$th power of a cycle with minimum degree at least $(1+\varepsilon)k$ has a Hamilton cycle.
asymptotic in k; the paper also shows the analogous statement is false for d = 2
Evidence graph
No public relationships recorded yet.