Math-1824 · mathematics · Graph theory

Math-1824

Some Questions — Question 6

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $G$ be an infinite finitely generated group and choose a finite inverse-closed generating set $S$ not containing the identity. Its Cayley graph has unit edges joining $g$ to $gs$. Let \[ B_R=\{g\in G:d(1,g)\leq R\},\qquad R=1,2,\ldots, \] and give $B_R$ the induced finite graph, retaining exactly the Cayley edges whose endpoints both lie in the ball. Edges leading outside the ball are not added to a boundary vertex or an absorbing sink.

For a finite graph $H$, define its edge expansion by \[ h(H)=\min_{0<|A|\leq|V(H)|/2} \frac{|E_H(A,V(H)\setminus A)|}{|A|}. \] A sequence of uniformly bounded-degree graphs with orders tending to infinity is an expander family if its expansion constants have a common positive lower bound.

Can $G,S$ be chosen so that $\inf_{R\geq1}h(B_R)>0$? Equivalently, can all sufficiently large metric balls in one infinite Cayley graph form an expander family? Finite initial exceptions do not matter, since each ball is connected. The balls need not be regular, so expansion is formulated directly using their induced edges. Nonamenability of the infinite graph alone is not the required property: its outward boundary edges are unavailable when testing cuts inside a finite induced ball. A sequence of expanding finite quotients would likewise describe different graphs.

Short English statement

Can the induced metric balls of one infinite Cayley graph form an expander family?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.