2000 character limit reached
Isoperimetric Inequalities on Hexagonal Grids
Published 3 Jan 2012 in math.CO and math.MG | (1201.0697v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.