Search arXiv⌕ Search

arXiv · 2009.04394

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 $p_1 \leq \mbox{deg}\ v \leq p_2$ for $v \in V(G)$ and $q_1 \leq \mbox{deg}\ f \leq q_2$ for $f \in F(G)$, where $p_1, p_2, q_1$, and $q_2$ are natural numbers such that $1/p_i + 1/q_i \leq 1/2$, $i=1,2$, then we show that \[ Φ(p_1, q_1) \leq \inf_S \frac{|\partial S|}{|V(S)|} \leq Φ(p_2, q_2), \] where the infimum is taken over all finite nonempty subgraphs $S \subset G$, $\partial S$ is the set of edges connecting $S$ to $G \setminus S$, and $Φ(p,q)$ is defined by \[ Φ(p, q) = (p-2) \sqrt{1 - \frac{4}{(p-2)(q-2)}}. \] For $p_1=3$ this gives an affirmative answer to a conjecture by Lawrencenko, Plummer, and Zha from 2002, and for general $p_i$ and $q_i$ 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Byung-Geun Oh. 2024-08-19. Sharp isoperimetric inequalities for infinite plane graphs with bounded vertex and face degrees. https://arxiv.org/abs/2009.04394

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗