General edge-isoperimetric inequalities. I: Information-theoretical methods

DOI10.1006/EUJC.1996.0105zbMath0940.05067OpenAlexW2811317572MaRDI QIDQ1357262

Ning Cai

Publication date: 27 July 1997

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

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

zbMATH Keywords

pathsprobabilitycyclesextremal problemsextremal subsetsedge-isoperimetric problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Extremal set theory (05D05)

Related Items (4)

Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path ⋮ Pull-push method: a new approach to edge-isoperimetric problems ⋮ Minimum Linear Arrangement of Generalized Sierpinski Graphs ⋮ Reflect-push methods. Part I: Two dimensional techniques

This page was built for publication: General edge-isoperimetric inequalities. I: Information-theoretical methods