Minors in lifts of graphs

DOI10.1002/rsa.20100zbMath1226.05235OpenAlexW4235790843WikidataQ58051345 ScholiaQ58051345MaRDI QIDQ3419590

Nathan Linial, Yotam Drier

Publication date: 7 February 2007

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20100

zbMATH Keywords

liftsHadwiger numberrandom liftsHajós number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83)

Related Items (8)

Cutoff for random lifts of weighted graphs ⋮ Complete Minors in Graphs Without Sparse Cuts ⋮ Low-distortion embeddings of graphs with large girth ⋮ Expander graphs and their applications ⋮ Random lifts of graphs are highly connected ⋮ Upper bound for the number of spanning forests of regular graphs ⋮ On the number of forests and connected spanning subgraphs ⋮ The chromatic number of random lifts of

Cites Work

• Hadwiger's conjecture is true for almost every graph
• Topological cliques in graphs II
• Unnamed Item

This page was built for publication: Minors in lifts of graphs