Isoperimetric Inequalities on Hexagonal Grids
classification
🧮 math.CO
math.MG
keywords
hexagonalnumberboundsgivengridgridsinfinitelower
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.