Planar lattice subsets with minimal vertex boundary

DOI10.37236/10055zbMath1473.05307arXiv2009.12122OpenAlexW3203261885MaRDI QIDQ820851

Emily Stark, Ivan Levcovitz, Alexander Margolis, Radhika Gupta

Publication date: 28 September 2021

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

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

zbMATH Keywords

minimal setsvertex isoperimetric problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of finite geometries (05B25) Extremal combinatorics (05D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\)
• Compressions and isoperimetric inequalities
• On isoperimetrically optimal polyforms
• Edge-isoperimetric inequalities in the grid
• Optimal labelling of a product of two paths
• A note on the edges of the n-cube
• On an isoperimetric problem for Hamming graphs
• A local-global principle for vertex-isoperimetric problems
• Polyominoes with minimum site-perimeter and full set achievement games
• Expander graphs and their applications
• A Simple Proof of the Karakhanyan–Riordan Theorem on the Even Discrete Torus
• Discrete Isoperimetric Problems
• An Ordering on the Even Discrete Torus
• Assignment of Numbers to Vertices
• Isoperimetry in integer lattices
• Maximally Connected Arrays on the n-Cube
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Planar lattice subsets with minimal vertex boundary