2012/01/03 by Berit Grußien, Grußien, Berit
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Metric Geometry (math.MG) #Point processes and geometric inequalities #math.CO #math.MG
paper · pdf · doi:10.48550/arxiv.1201.0697
arxiv created 2012/01/03 · openalex publication_date 2012/01/03 · arxiv updated 2012/01/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower bounds for the number of vertices in the neighborhood of W and for the number of vertices in the boundary of W. For the infinite hexagonal grid the given bounds are tight.