On the Edge-Expansion of Graphs
From MaRDI portal
Publication:4348783
DOI10.1017/S096354839700299XzbMath0881.05077MaRDI QIDQ4348783
Publication date: 16 February 1998
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (17)
Bounds on the bisection width for random \(d\)-regular graphs ⋮ Upper bounds on the bisection width of 3- and 4-regular graphs ⋮ On the minimum bisection of random 3-regular graphs ⋮ A note on internal partitions: the 5-regular case and beyond ⋮ Towards optimal spectral gaps in large genus ⋮ Note on the bisection width of cubic graphs ⋮ Expander graphs and their applications ⋮ Factors of IID on Trees ⋮ Long-Range Percolation Mixing Time ⋮ Metastability of the Ising model on random regular graphs at zero temperature ⋮ Component Games on Regular Graphs ⋮ Satisfactory graph partition, variants, and generalizations ⋮ On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model ⋮ Asymptotically almost every \(2r\)-regular graph has an internal partition ⋮ New lower bounds on the size-Ramsey number of a path ⋮ Isoperimetric numbers of randomly perturbed intersection graphs ⋮ Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
This page was built for publication: On the Edge-Expansion of Graphs
