Sharp isoperimetric inequalities for infinite plane graphs with bounded vertex and face degrees

Abstract

We provide sharp bounds for the isoperimetric constants of infinite plane graphs (tessellations) with bounded vertex and face degrees. For example, if G is a plane graph satisfying the inequalities p1 ≤ deg\ v ≤ p2 for v ∈ V(G) and q1 ≤ deg\ f ≤ q2 for f ∈ F(G), where p1, p2, q1, and q2 are natural numbers such that 1/pi + 1/qi ≤ 1/2, i=1,2, then we show that \[ (p1, q1) ≤ ∈fS |∂ S||V(S)| ≤ (p2, q2), \] where the infimum is taken over all finite nonempty subgraphs S ⊂ G, ∂ S is the set of edges connecting S to G S, and (p,q) is defined by \[ (p, q) = (p-2) 1 - 4(p-2)(q-2). \] For p1=3 this gives an affirmative answer to a conjecture by Lawrencenko, Plummer, and Zha from 2002, and for general pi and qi our result fully resolves a question posed in the book by Lyons and Peres from 2016, where they extended the conjecture of Lawrencenko et al. to the above form.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…