Minors in lifts of graphs
From MaRDI portal
Publication:3419590
DOI10.1002/rsa.20100zbMath1226.05235WikidataQ58051345 ScholiaQ58051345MaRDI QIDQ3419590
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
Related Items
Complete Minors in Graphs Without Sparse Cuts, Low-distortion embeddings of graphs with large girth, Random lifts of graphs are highly connected, On the number of forests and connected spanning subgraphs, Cutoff for random lifts of weighted graphs, Upper bound for the number of spanning forests of regular graphs, The chromatic number of random lifts of, Expander graphs and their applications
Cites Work