Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs

DOI10.1006/eujc.1998.0295zbMath0935.05053OpenAlexW1995059637MaRDI QIDQ1306928

Noga Alon, Peter Hamburger, Alexandr V. Kostochka

Publication date: 4 May 2000

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1998.0295

zbMATH Keywords

edge-integrityhonest graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (2)

Minimal selectors and fault tolerant networks ⋮ New lower bounds on the size-Ramsey number of a path

Cites Work

• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Ramanujan graphs
• The isoperimetric number of random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Cubic graphs and the first eigenvalue of a Riemann surface
• On the honesty of graph complements
• A note on bipartite subgraphs of triangle‐free graphs
• On the Edge-Expansion of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs