Expanders have a spanning Lipschitz subgraph with large girth

Abstract

We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau and Lyons. We give a new proof and strengthen the Gaboriau-Lyons result, that allows us to answer two questions of Monod about geometric random subgroups. Our finite theorems are kind of converse to the theorem of Bourgain and Gamburd showing that large girth implies expansion for Cayley graphs of SL_2(F_p). We apply these to the regular case of Thomassen's conjecture stating that every finite graph with large average degree has a subgraph with large girth and average degree. Our main tool is an infinite version of the Lovasz Local Lemma developed in this paper.

References in corpus (1)

• Orbit inequivalent actions of non-amenable groups

Cited by in corpus (8)

• Ramanujan graphings and correlation decay in local algorithms
• Invariant Coupling of Determinantal Measures on Sofic Groups
• Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
• Free Subshifts with Invariant Measures from the Lovász Local Lemma
• Existence of spanning $\mathcal{F}$-free subgraphs with large minimum degree
• Factor-of-iid balanced orientation of non-amenable graphs
• Correlation bound for distant parts of factor of IID processes
• Expander spanning subgraphs with large girth