Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs

DOI10.1137/120891265zbMath1296.05176arXiv1311.6555OpenAlexW1974452921MaRDI QIDQ4979855

Brett Kolesnik, Nicholas C. Wormald

Publication date: 19 June 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.6555

zbMATH Keywords

expansionexpanderisoperimetric numberrandom regular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)

Related Items (6)

Large expanders in high genus unicellular maps ⋮ Adjacency matrices of random digraphs: singularity and anti-concentration ⋮ A new approach to finding the extra connectivity of graphs ⋮ Gonality of expander graphs ⋮ Strongly Sublinear Separators and Polynomial Expansion ⋮ Minimum Power Dominating Sets of Random Cubic Graphs

This page was built for publication: Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs