Growth and isoperimetric profile of planar graphs
Abstract
Let G be a planar graph such that the volume function of G satisfies V(2n)< CV(n) for some constant C > 0. Then for every vertex v of G and integer n, there is a domain such that B(v,n) ⊂ , ⊂ B(v, 6n) and the size of the boundary of is at most order n.
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.