Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\)

zbMath1252.05094arXiv1202.4204MaRDI QIDQ456299

Ellen Veomett, Andrew John Radcliffe

Publication date: 24 October 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.4204

zbMATH Keywords

discrete isoperimetric inequalities

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (8)

Planar lattice subsets with minimal vertex boundary ⋮ Interpolating between volume and lattice point enumerator with successive minima ⋮ Isoperimetric stability in lattices ⋮ An extremal graph problem on a grid and an isoperimetric problem for polyominoes ⋮ On a characterization of lattice cubes via discrete isoperimetric inequalities ⋮ On discrete Brunn-Minkowski and isoperimetric type inequalities ⋮ Isoperimetry in integer lattices ⋮ A general method to determine limiting optimal shapes for edge-isoperimetric inequalities

This page was built for publication: Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\)