KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
From MaRDI portal
Publication:2971036
DOI10.1017/fms.2016.22zbMath1358.05099arXiv1408.1973OpenAlexW2963358977MaRDI QIDQ2971036
Gabor Lippner, Oleg Pikhurko, Endre Csóka
Publication date: 4 April 2017
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.1973
Measure-preserving transformations (28D05) Descriptive set theory (03E15) Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05) Vertex degrees (05C07) General groups of measure-preserving transformations and dynamical systems (37A15) Measurable group actions (22F10) Infinite graphs (05C63)
Related Items (8)
Approximate Schreier decorations and approximate Kőnig's line coloring theorem ⋮ Extension from precoloured sets of edges ⋮ Definable Kőnig theorems ⋮ Groups and dynamics: topology, measure, and Borel structure. Abstracts from the workshop held January 16--22, 2022 ⋮ Measurable versions of Vizing's theorem ⋮ Measurable versions of the Lovász local lemma and measurable graph colorings ⋮ Invariant Schreier decorations of unimodular random networks ⋮ Orienting Borel graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Perfect matchings as IID factors on non-amenable groups
- On limits of finite graphs
- Borel chromatic numbers
- Recurrence of distributional limits of finite planar graphs
- Topics in orbit equivalence
- Measurable chromatic and independence numbers for ergodic graphs and group actions
- Cost of equivalence relations and groups
- Limits of locally-globally convergent graph sequences
- Processes on unimodular random networks
- A determinacy approach to Borel combinatorics
- Concentration for Independent Permutations
- A short proof for a generalization of Vizing's theorem
- Borel oracles. An analytical approach to constant-time algorithms
- Mercuriale de groupes et de relations
- On the cost of generating an equivalence relation
- Sparse graphs: Metrics and random models
- The Factorization of Linear Graphs
This page was built for publication: KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
