For pseudorandom graphs with large spectral gap, every subgraph with minimum degree above d/2 is Hamiltonian, and the whole edge set can be packed into, and covered by, about d/2 Hamilton cycles.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
For pseudorandom graphs with large spectral gap, every subgraph with minimum degree above d/2 is Hamiltonian, and the whole edge set can be packed into, and covered by, about d/2 Hamilton cycles.