General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions

DOI10.1006/EUJC.1996.0106MaRDI QIDQ1362991zbMATH OpenOpenAlexFDO

Authors Ning Cai, Rudolf Ahlswede

Publication date 25 November 1997

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

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

zbMATH Keywords

boundary edgesCartesian sumedge-isoperimetric problemsinner edgeslexicographical orderset functionsubmodularity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 2044916
• General edge-isoperimetric inequalities. I: Information-theoretical methods
• Edge-isoperimetric problems for Cartesian powers of regular graphs
• The edge-isoperimetric problem for discrete tori

Cited in

(20)

• On an equivalence in discrete extremal problems
• The exact isoperimetric inequality for ternary and quaternary cubes
• General edge-isoperimetric inequalities. I: Information-theoretical methods
• The edge-isoperimetric problem for discrete tori
• New infinite family of regular edge-isoperimetric graphs
• A local-global principle for vertex-isoperimetric problems
• Edge-isoperimetric problems for Cartesian powers of regular graphs
• scientific article; zbMATH DE number 1303526 (Why is no real title available?)
• scientific article; zbMATH DE number 2044916 (Why is no real title available?)
• A new approach to Macaulay posets
• Pull-push method: a new approach to edge-isoperimetric problems
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
• Reflect-push methods. Part I: Two dimensional techniques
• Reliability analysis of the quinary n-cube networks with non-lexicographic order optimal solution of the edge isoperimetric problem
• Towards a complete local-global principle
• Triangle Inequalities Indexed by Graphs
• Ning Cai: a tribute to a pioneering scholar in information theory
• The carving-width of generalized hypercubes
• Compressions and isoperimetric inequalities
• On partitioning of hypergraphs

This page was built for publication: General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362991)