On packing Hamilton cycles in \(\varepsilon\)-regular graphs

From MaRDI portal
Publication:1775898

DOI10.1016/j.jctb.2004.12.003zbMath1061.05053OpenAlexW2140606499WikidataQ57401506 ScholiaQ57401506MaRDI QIDQ1775898

Michael Krivelevich, Alan M. Frieze

Publication date: 4 May 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.12.003



Related Items

Packing tight Hamilton cycles in 3-uniform hypergraphs, Proof of the 1-factorization and Hamilton Decomposition Conjectures, Packing hamilton cycles in random and pseudo-random hypergraphs, Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, Counting and packing Hamilton cycles in dense graphs and oriented graphs, The number of Hamiltonian decompositions of regular graphs, Long directed rainbow cycles and rainbow spanning trees, Packing tree factors in random and pseudo-random graphs, A survey on Hamilton cycles in directed graphs, Graph and hypergraph packing, Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs, Hamilton decompositions of regular expanders: applications, Packing Loose Hamilton Cycles, Recent advances on the Hamiltonian problem: survey III, A Dirac-Type Result on Hamilton Cycles in Oriented Graphs, Optimal covers with Hamilton cycles in random graphs, On two Hamilton cycle problems in random graphs, On covering expander graphs by hamilton cycles, Edge-disjoint Hamilton cycles in graphs, Path and cycle decompositions of dense graphs, Random directed graphs are robustly Hamiltonian, A hypergraph blow-up lemma, Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs, Note on matching preclusion number of random graphs, Approximate Hamilton decompositions of random graphs, Edge-disjoint Hamilton cycles in random graphs



Cites Work