On the Edge-Expansion of Graphs
From MaRDI portal
Publication:4348783
DOI10.1017/S096354839700299XzbMATH Open0881.05077MaRDI QIDQ4348783FDOQ4348783
Authors: Noga Alon 
Publication date: 16 February 1998
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
- On expansive graphs
- The direct expansion of graphs
- scientific article; zbMATH DE number 15874
- Expander graphs and their applications
- On the Structure of Edge Graphs
- Expansions of ultrahomogeneous graphs
- scientific article; zbMATH DE number 2196285
- On the edge dimension of a graph
- On exponential edge domination number of a graph
- Expansion in matrix-weighted graphs
Cited In (31)
- Expansion in matrix-weighted graphs
- On the minimum bisection of random 3-regular graphs
- On minimum vertex bisection of random \(d\)-regular graphs
- Towards optimal spectral gaps in large genus
- Expansion and Lack Thereof in Randomly Perturbed Graphs
- Isoperimetric numbers of randomly perturbed intersection graphs
- Random Lifts of Graphs: Edge Expansion
- Expanding graphs and invariant means
- Note on the bisection width of cubic graphs
- Tight products and graph expansion
- Factors of IID on trees
- Lower bounds on expansions of graph powers
- Gonality of expander graphs
- Limitations on Explicit Constructions of Expanding Graphs
- Degrees in link graphs of regular graphs
- On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model
- Long-Range Percolation Mixing Time
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
- Bipartite multigraphs with expander-like properties
- Satisfactory graph partition, variants, and generalizations
- Expanders via local edge flips in quasilinear time
- Upper bounds on the bisection width of 3- and 4-regular graphs
- On Constructing Expanders for Any Number of Vertices
- Expander graphs and their applications
- New lower bounds on the size-Ramsey number of a path
- Edge growth in graph squares
- Asymptotically almost every \(2r\)-regular graph has an internal partition
- A note on internal partitions: the 5-regular case and beyond
- Component games on regular graphs
- Bounds on the bisection width for random \(d\)-regular graphs
- Metastability of the Ising model on random regular graphs at zero temperature
This page was built for publication: On the Edge-Expansion of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4348783)
