Counting and packing Hamilton cycles in dense graphs and oriented graphs

DOI10.1016/j.jctb.2016.06.001zbMath1350.05063arXiv1212.4667OpenAlexW1554423888MaRDI QIDQ345082

Michael Krivelevich, Asaf Ferber, Benjamin Sudakov

Publication date: 25 November 2016

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

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

zbMATH Keywords

packingcountingoriented graphsHamilton cycles

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

Related Items

Proof of the 1-factorization and Hamilton Decomposition Conjectures, Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments, Hamilton cycles in sparse robustly expanding digraphs, The number of Hamiltonian decompositions of regular graphs, Cycle lengths in randomly perturbed graphs, The number of bounded‐degree spanning trees, On the Maximum Number of Spanning Copies of an Orientation in a Tournament, Hamilton decompositions of regular expanders: applications, Packing, counting and covering Hamilton cycles in random directed graphs, Compatible Hamilton cycles in Dirac graphs, Random directed graphs are robustly Hamiltonian, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, Decomposing hypergraphs into cycle factors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of Hamilton cycles in pseudo-random graphs
• Edge-disjoint Hamilton cycles in graphs
• Hamiltonian degree sequences in digraphs
• Hamiltonian cycles in Dirac graphs
• Minimum degree of a graph and the existence of k-factors
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Hamiltonian circuits in random graphs
• Problems and results in extremal combinatorics. I.
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs
• On the number of Hamiltonian cycles in Dirac graphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• The maximum number of Hamiltonian paths in tournaments
• Hamilton decompositions of regular expanders: applications
• Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs
• Approximate Hamilton decompositions of random graphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Local resilience of graphs
• Hamilton Cycles in Oriented Graphs
• Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
• Edge-disjoint Hamilton cycles in random graphs
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Hamiltonian Cycles in Regular Tournaments
• On the Number of Hamilton Cycles in Sparse Random Graphs
• On the Number of Hamiltonian Cycles in a Tournament
• Some Theorems on Abstract Graphs