Invariant Schreier decorations of unimodular random networks

DOI10.5802/ahl.114zbMath1492.37048arXiv1906.03137OpenAlexW2948904879MaRDI QIDQ2077204

László Márton Tóth

Publication date: 24 February 2022

Published in: Annales Henri Lebesgue (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.03137

zbMATH Keywords

graph limitsunimodular random graphSchreier graphinvariant random subgroup

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Free nonabelian groups (20E05) Dynamical systems involving maps of trees and graphs (37E25) Random iteration (37H12)

Related Items

Approximate Schreier decorations and approximate Kőnig's line coloring theorem ⋮ Factor-of-iid balanced orientation of non-amenable graphs ⋮ Borel fractional colorings of Schreier graphs

Cites Work

• Unnamed Item
• On limits of finite graphs
• Borel chromatic numbers
• Recurrence of distributional limits of finite planar graphs
• Measurable chromatic and independence numbers for ergodic graphs and group actions
• On invariant Schreier structures
• Invariant random perfect matchings in Cayley graphs
• Kesten's theorem for invariant random subgroups.
• Limits of locally-globally convergent graph sequences
• Processes on unimodular random networks
• Unimodularity of invariant random subgroups
• KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
• Closed Sets Without Measurable Matching