The robust component structure of dense regular graphs and applications
From MaRDI portal
Publication:2940076
DOI10.1112/plms/pdu039zbMath1307.05130arXiv1401.0424OpenAlexW3101429032MaRDI QIDQ2940076
Daniela Kühn, Allan Lo, Deryk Osthus, Katherine Staden
Publication date: 26 January 2015
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.0424
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)
Related Items
Cycle partitions of regular graphs ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs ⋮ A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ Perfect matchings in random subgraphs of regular bipartite graphs ⋮ Path decompositions of tournaments ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Hamilton cycles in dense regular digraphs and oriented graphs ⋮ Random perfect matchings in regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- A survey on Hamilton cycles in directed graphs
- Hamilton cycles in dense vertex-transitive graphs
- An approximate version of Sumner's universal tournament conjecture
- Hamiltonian degree sequences in digraphs
- Longest cycles in regular graphs
- Dominating cycles in regular 3-connected graphs
- Hamilton cycles in regular 3-connected graphs
- Hamilton cycles in regular 2-connected graphs
- On the circumferences of regular 2-connected graphs
- Hamilton cycles in 2-connected regular bipartite graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamilton decompositions of regular expanders: applications
- A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
- A note on regular Ramsey graphs
- A proof of Sumner's universal tournament conjecture for large tournaments
- Long paths and cycles in oriented graphs
