Random lifts of graphs are highly connected

zbMath1266.05157MaRDI QIDQ1953505

Marcin Witkowski

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p23

zbMATH Keywords

random graphslifts of graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Related Items

\(\delta\)-connectivity in random lifts of graphs ⋮ Hamilton cycles in random lifts of graphs

Cites Work

• Random graph coverings. I: General theory and graph connectivity
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Random lifts of graphs: perfect matchings
• Minors in lifts of graphs
• Hamilton Cycles in Random Lifts of Directed Graphs
• Random lifts of graphs: Independence and chromatic number
• Random Lifts of Graphs: Edge Expansion
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• Hamilton cycles in random lifts of graphs

This page was built for publication: Random lifts of graphs are highly connected