pith. sign in

arxiv: 1004.4726 · v1 · pith:QQGWYLBBnew · submitted 2010-04-27 · 🧮 math.MG

Growth and isoperimetric profile of planar graphs

classification 🧮 math.MG
keywords omegaplanarsubsetboundaryconstantdomaineveryfunction
0
0 comments X
read the original 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 \Omega such that B(v,n) \subset \Omega, \Omega \subset B(v, 6n) and the size of the boundary of \Omega is at most order n.

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.