Packing, counting and covering Hamilton cycles in random directed graphs

DOI10.1016/j.endm.2015.06.109zbMath1346.05151arXiv1506.00618OpenAlexW2126781761MaRDI QIDQ5890928

Gal Kronenberg, Asaf Ferber, Eoin Long

Publication date: 14 October 2016

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.00618

zbMATH Keywords

random graphsdirected graphsHamilton cycles

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Packing Loose Hamilton Cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of Hamilton cycles in pseudo-random graphs
• Optimal covers with Hamilton cycles in random graphs
• On two Hamilton cycle problems in random graphs
• Hamiltonian cycles in Dirac graphs
• Hamiltonian circuits in random graphs
• On the number of Hamiltonian cycles in Dirac graphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Hamilton decompositions of regular expanders: applications
• On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
• The Evolution of Random Graphs
• An algorithm for finding hamilton cycles in random directed graphs
• Clutter percolation and random graphs
• Optimal Packings of Hamilton Cycles in Sparse Random Graphs
• Hamiltonian Cycles in Regular Tournaments
• On the Number of Hamilton Cycles in Sparse Random Graphs
• On covering expander graphs by hamilton cycles
• Some Theorems on Abstract Graphs

This page was built for publication: Packing, counting and covering Hamilton cycles in random directed graphs