Hamilton cycles in random lifts of graphs

DOI10.1016/J.EJC.2015.03.001zbMath1315.05082arXiv1306.2057OpenAlexW1985729477MaRDI QIDQ5919762

Tomasz Łuczak, Łukasz Witkowski, Marcin Witkowski

Publication date: 18 June 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian random lifts

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random graph coverings. I: General theory and graph connectivity
• Hamiltonian circuits in random graphs
• Random lifts of graphs are highly connected
• Random lifts of graphs: perfect matchings
• Hamilton Cycles in Random Lifts of Directed Graphs
• Random lifts of graphs: Independence and chromatic number
• Sparse pseudo‐random graphs are Hamiltonian
• Random Lifts of Graphs: Edge Expansion
• Hamilton cycles in random lifts of graphs

This page was built for publication: Hamilton cycles in random lifts of graphs