Isoperimetry in integer lattices

DOI10.19086/da.3555zbMath1404.05074arXiv1707.04411OpenAlexW3100978625WikidataQ129738144 ScholiaQ129738144MaRDI QIDQ4645032

Joshua Erde, Ben Barber

Publication date: 9 January 2019

Published in: Discrete Analysis (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)

Related Items

Planar lattice subsets with minimal vertex boundary, Symmetry breaking in two-dimensional square grids: persistence and failure of the dimensional crossover, Isoperimetric stability in lattices, An extremal graph problem on a grid and an isoperimetric problem for polyominoes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\)
• A general method to determine limiting optimal shapes for edge-isoperimetric inequalities
• Compressions and isoperimetric inequalities
• Edge-isoperimetric inequalities in the grid
• Some simplified NP-complete graph problems
• A note on the edges of the n-cube
• On an isoperimetric problem for Hamming graphs
• Erdös distance problems in normed spaces
• Almost Isoperimetric Subsets of the Discrete Cube
• Expander codes
• Vertex Bisection is Hard, too
• Approximating the Permanent
• Computing the Continuous Discretely
• Discrete Isoperimetric Problems
• Assignment of Numbers to Vertices
• Maximally Connected Arrays on the n-Cube
• Optimal numberings and isoperimetric problems on graphs
• Eine zahlentheoretische Anwendung der Graphentheorie.
• Optimal Assignments of Numbers to Vertices
• An inequality related to the isoperimetric inequality
• Colloquium De Giorgi 2013 and 2014