On the number of connected subgraphs with small edge‐boundary in regular graphs

DOI10.1002/rsa.3240050114zbMath0798.05031OpenAlexW2146587385MaRDI QIDQ4288885

Alexandr V. Kostochka

Publication date: 20 October 1994

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

Full work available at URL: https://doi.org/10.1002/rsa.3240050114

zbMATH Keywords

upper boundregular graphs\(n\)-cubeconnected subgraphsedge-boundaryHamming theoremHarper's isoperimetric inequality

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (2)

Sharp threshold for the Erdős–Ko–Rado theorem ⋮ On the number of connected sets with the neighborhood of a given size in a graph

This page was built for publication: On the number of connected subgraphs with small edge‐boundary in regular graphs