Discrete Isoperimetric Problems
From MaRDI portal
Publication:4135579
DOI10.1137/0132073zbMATH Open0362.05047OpenAlexW2067107081MaRDI QIDQ4135579FDOQ4135579
Publication date: 1977
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0132073
Extremal problems in graph theory (05C35) Other designs, configurations (05B30) Total orders (06A05)
Cited In (33)
- Planar lattice subsets with minimal vertex boundary
- THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS
- On the complexity of finding a local maximum of functions on discrete planar subsets
- On isoperimetrically optimal polyforms
- Minimal growth function of uniform amenability for discrete abelian groups
- On a characterization of lattice cubes via discrete isoperimetric inequalities
- Metastability of hard-core dynamics on bipartite graphs
- Tunneling behavior of Ising and Potts models in the low-temperature regime
- Compressions and isoperimetric inequalities
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees
- Edge-isoperimetric inequalities in the grid
- Isoperimetry, stability, and irredundance in direct products
- A note on the integrity of grids
- On systems of finite sets with constraints on their unions and intersections
- Rearrangement inequalities on the lattice graph
- Symmetry breaking in two-dimensional square grids: persistence and failure of the dimensional crossover
- Minimum-perimeter lattice animals and the constant-isomer conjecture
- Discrepancies of spanning trees and Hamilton cycles
- VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH
- On the independence number of sparser random Cayley graphs
- Isoperimetry in integer lattices
- Asymptotic estimates for the \(p\)-Laplacian on infinite graphs with decaying initial data
- Sums in the grid
- Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary
- Isoperimetric stability in lattices
- Counting sets with small sumset and applications
- The vertex isoperimetric problem for the powers of the diamond graph
- Algorithms for counting minimum-perimeter lattice animals
- On a problem of Yuzvinsky on separating the n-cube
- Isoperimetric inequalities and fractional set systems
- The double-bubble problem on the square lattice
- Isoperimetrically Optimal Polygons in the Triangular Grid
- An extremal graph problem on a grid and an isoperimetric problem for polyominoes
This page was built for publication: Discrete Isoperimetric Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4135579)