Complete Minors in Graphs Without Sparse Cuts
From MaRDI portal
Publication:5068162
DOI10.1093/imrn/rnz086OpenAlexW2903473694WikidataQ128080653 ScholiaQ128080653MaRDI QIDQ5068162
Rajko Nenadov, Michael Krivelevich
Publication date: 5 April 2022
Published in: International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.01961
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complete minors in \(K_{s,s}\)-free graphs
- Dense minors in graphs of large girth
- Lower bound of the Hadwiger number of graphs by their average degree
- Girth in graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Minors in expanding graphs
- Eigenvalues and expanders
- Approximate counting, uniform generation and rapidly mixing Markov chains
- The isoperimetric number of random regular graphs
- Hadwiger's conjecture is true for almost every graph
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- The spectral gap of dense random regular graphs
- Asymptotic enumeration by degree sequence of graphs of high degree
- The extremal function for complete minors
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- Random regular graphs of high degree
- Introduction to Random Graphs
- Minors in random regular graphs
- An extremal function for contractions of graphs
- Minors in lifts of graphs
- A Separator Theorem for Nonplanar Graphs
- Every planar map is four colorable
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- Minors in graphs of large girth
- Expanders – how to find them, and what to find in them
- The order of the largest complete minor in a random graph
