Pré-Publication, Document De Travail Année : 2016

Treeable Graphings are Local Limits of Finite Graphs

Résumé

Let G be a graphing, that is a Borel graph defined by d measure preserving involutions. We prove that if G is treeable then it arises as the local limit of some sequence (Gn) of graphs with maximum degree at most d. This extends a result by Elek (for G a treeing) and consequently extends the domain of the graphings for which Aldous–Lyons conjecture is known to be true.

Fichier principal
Vignette du fichier
graphings.pdf (144.79 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01252409 , version 1 (07-01-2016)

Licence

Identifiants

  • HAL Id : hal-01252409 , version 1

Citer

Lucas Hosseini, Patrice Ossona de Mendez. Treeable Graphings are Local Limits of Finite Graphs. 2016. ⟨hal-01252409⟩

Collections

129 Consultations
207 Téléchargements

Partager

  • More