Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
From MaRDI portal
Publication:1946787
DOI10.1016/j.aim.2013.01.005zbMath1261.05053arXiv1202.6219OpenAlexW2081157042WikidataQ123122981 ScholiaQ123122981MaRDI QIDQ1946787
Publication date: 16 April 2013
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.6219
Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items
Cycle partitions of regular graphs ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Packing spanning graphs from separable families ⋮ Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ The robust component structure of dense regular graphs and applications ⋮ Arbitrary Orientations of Hamilton Cycles in Digraphs ⋮ The bilinear assignment problem: complexity and polynomially solvable special cases ⋮ The number of Hamiltonian decompositions of regular graphs ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Successive minimum spanning trees ⋮ Path decompositions of tournaments ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Proof of Komlós's conjecture on Hamiltonian subsets ⋮ Decomposing tournaments into paths ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ Hamilton cycles in dense regular digraphs and oriented graphs ⋮ Random perfect matchings in regular graphs ⋮ Threshold for Steiner triple systems ⋮ Graph and hypergraph packing ⋮ Hamilton decompositions of regular expanders: applications ⋮ Minimalist designs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ A rainbow blow‐up lemma ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Almost all Steiner triple systems are almost resolvable ⋮ Packing edge-disjoint triangles in regular and almost regular tournaments ⋮ Decompositions of complete uniform hypergraphs into Hamilton Berge cycles ⋮ Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms ⋮ Optimal covers with Hamilton cycles in random graphs ⋮ A blow-up lemma for approximate decompositions ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ Long cycles, heavy cycles and cycle decompositions in digraphs ⋮ Optimal packings of bounded degree trees ⋮ Automorphism groups of Walecki tournaments with zero and odd signatures ⋮ Resolution of the Oberwolfach problem ⋮ A domination algorithm for {0,1}-instances of the travelling salesman problem ⋮ Path and cycle decompositions of dense graphs ⋮ An approximate version of Jackson’s conjecture ⋮ Note on matching preclusion number of random graphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Edge-disjoint Hamilton cycles in random graphs
