Proves an asymptotic version of the conjecture that Dirac subgraphs of cycle powers are Hamiltonian.
New bounds for linear arboricity and related problems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Every large connected Cayley graph with degree at least n to the power 1-c for some fixed c>0 has a Hamilton cycle.
citing papers explorer
-
Dirac subgraphs of powers of cycles are Hamiltonian
Proves an asymptotic version of the conjecture that Dirac subgraphs of cycle powers are Hamiltonian.
-
The Lov\'asz conjecture holds for moderately dense Cayley graphs
Every large connected Cayley graph with degree at least n to the power 1-c for some fixed c>0 has a Hamilton cycle.