The isoperimetric constant of the random graph process

DOI10.1002/rsa.20171zbMath1132.05056arXivmath/0509022OpenAlexW2953264933MaRDI QIDQ5436979

Simi Haber, Eyal Lubetzky, Michael Krivelevich, Itai Benjamini

Publication date: 18 January 2008

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

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

zbMATH Keywords

isoperimetric constantminimal degreerandom graph processconductance

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Simple random walk on long range percolation clusters. I: Heat kernel bounds, The mixing time of a random walk on a long-range percolation cluster in pre-Sierpinski gasket, COBOUNDARY EXPANDERS, Hamiltonicity thresholds in Achlioptas processes, Strong noise sensitivity and random graphs, Isoperimetric numbers of randomly perturbed intersection graphs

Cites Work

• The isoperimetric number of random regular graphs