Treeable Graphings Are Local Limits of Finite Graphs

Publication date: 21 January 2016

Abstract: Let

m a t h b f G

be a graphing, that is a Borel graph defined by

d

measure preserving involutions. We prove that if

m a t h b f G

is {em treeable} then it arises as the local limit of some sequence

(G_{n})_{n i n m a t h b b N}

of graphs with maximum degree at most

d

. This extends a result by Elek [G. Elek, Note on limits of finite graphs, Combinatorica 27 (2007)] (for

m a t h b f G

a treeing) and consequently extends the domain of the graphings for which Aldous-Lyons conjecture is known to be true.

This page was built for publication: Treeable Graphings Are Local Limits of Finite Graphs