Edge isoperimetric theorems for integer point arrays
From MaRDI portal
Publication:1893693
DOI10.1016/0893-9659(95)00015-IzbMath0830.05040MaRDI QIDQ1893693
Sergei L. Bezrukov, Rudolf Ahlswede
Publication date: 20 July 1995
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Related Items
VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH, Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path, THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS, Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem, Unnamed Item, Efficient embeddings of grids into grids, Pull-push method: a new approach to edge-isoperimetric problems, The carving-width of generalized hypercubes, Escaping offline searchers and isoperimetric theorems, On an equivalence in discrete extremal problems, On \(k\)-ary \(n\)-cubes: Theory and applications., A new lower bound for the bipartite crossing number with applications, Edge-isoperimetric problems for Cartesian powers of regular graphs, Maximal fluctuations around the Wulff shape for edge-isoperimetric sets in \({\mathbb{Z}}^d \): a sharp scaling law
Cites Work