Optimal Packings of Hamilton Cycles in Sparse Random Graphs
From MaRDI portal
Publication:4899037
DOI10.1137/110849171zbMath1256.05194arXiv1109.5341OpenAlexW2066266229WikidataQ105584137 ScholiaQ105584137MaRDI QIDQ4899037
Michael Krivelevich, Wojciech Samotij
Publication date: 4 January 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.5341
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Proof of the 1-factorization and Hamilton Decomposition Conjectures, Packing Directed Hamilton Cycles Online, Packing Hamilton Cycles Online, Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs, Packing tree factors in random and pseudo-random graphs, Proof of Komlós's conjecture on Hamiltonian subsets, Hamilton decompositions of regular expanders: applications, On Hamilton cycles in Erdős‐Rényi subgraphs of large graphs, Packing Loose Hamilton Cycles, On randomk-out subgraphs of large graphs, Recent advances on the Hamiltonian problem: survey III, On prisms, Möbius ladders and the cycle space of dense graphs, Optimal path and cycle decompositions of dense quasirandom graphs, Packing, counting and covering Hamilton cycles in random directed graphs, Packing and counting arbitrary Hamilton cycles in random digraphs, Packing Arborescences in Random Digraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Optimal covers with Hamilton cycles in random graphs, Packing, counting and covering Hamilton cycles in random directed graphs, On covering expander graphs by hamilton cycles, Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree, Random directed graphs are robustly Hamiltonian, Note on matching preclusion number of random graphs, Edge-disjoint Hamilton cycles in random graphs
