Minors in small-set expanders

DOI10.1090/PROC/17481MaRDI QIDQ6843306zbMATH OpenFDO

Authors Michael Krivelevich, Rajko Nenadov

Publication date 17 March 2026

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/PROC/17481

zbMATH Keywords

large graphs as minors in vertex expanders

Mathematics Subject Classification ID

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

Cites work

• 37th annual symposium on foundations of computer science, FOCS 1996. Proceedings, Burlington, VT, USA, October 14--16, 1996
• A Separator Theorem for Nonplanar Graphs
• An extremal function for contractions of graphs
• Breaking the degeneracy barrier for coloring graphs with no K_t minor
• Clique minors in graphs with a forbidden subgraph
• Complete minors and average degree: A short proof
• Complete minors and independence number
• Complete minors in \(K_{s,s}\)-free graphs
• Complete Minors in Graphs Without Sparse Cuts
• Dense graphs have \(K_{3,t}\) minors
• Dense minors in graphs of large girth
• Expanders -- how to find them, and what to find in them
• Explicit construction of linear sized tolerant networks
• Extremal density for sparse minors and subdivisions
• Extremal functions for sparse minors
• Forcing a sparse minor
• Forcing unbalanced complete bipartite minors
• Hadwiger's conjecture is true for almost every graph
• scientific article; zbMATH DE number 1003278 (Why is no real title available?)
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• Independence number in triangle-free graphs avoiding a clique minor
• Introduction to Random Graphs
• Large complete minors in random subgraphs
• Large minors in graphs with given independence number
• Lower bound of the Hadwiger number of graphs by their average degree
• Minors in expanding graphs
• Minors in graphs of large girth
• Minors in lifts of graphs
• Minors in random regular graphs
• On \(K_{s,t}\)-minors in graphs with given average degree
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• Reducing linear Hadwiger's conjecture to coloring small graphs
• The chromatic number of random graphs
• The edge-density for \(K_{2,t}\) minors
• The extremal function for noncomplete minors
• The number of spanning trees in graphs with a given degree sequence
• The order of the largest complete minor in a random graph
• The spectral gap of dense random regular graphs
• The spectral gap of random regular graphs
• Über eine Eigenschaft der ebenen Komplexe

This page was built for publication: Minors in small-set expanders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6843306)