General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
From MaRDI portal
Publication:1362991
DOI10.1006/EUJC.1996.0106zbMATH Open0878.05050OpenAlexW2100449986MaRDI QIDQ1362991FDOQ1362991
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
Recommendations
submodularityset functionlexicographical orderCartesian sumboundary edgesedge-isoperimetric problemsinner edges
Cited In (13)
- Edge-isoperimetric problems for Cartesian powers of regular graphs
- On partitioning of hypergraphs
- New infinite family of regular edge-isoperimetric graphs
- The carving-width of generalized hypercubes
- The edge-isoperimetric problem for discrete tori
- A new approach to Macaulay posets
- Pull-push method: a new approach to edge-isoperimetric problems
- A local-global principle for vertex-isoperimetric problems
- Reflect-push methods. Part I: Two dimensional techniques
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
- The exact isoperimetric inequality for ternary and quaternary cubes
- General edge-isoperimetric inequalities. I: Information-theoretical methods
- Title not available (Why is that?)
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)