A bound on measurable chromatic numbers of locally finite Borel graphs
From MaRDI portal
Publication:2396647
DOI10.4310/MRL.2016.v23.n6.a3zbMath1432.03086MaRDI QIDQ2396647
Benjamin D. Miller, Clinton T. Conley
Publication date: 24 May 2017
Published in: Mathematical Research Letters (Search for Journal in Brave)
Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)
Related Items (13)
Symmetric Measures, Continuous Networks, and Dynamics ⋮ Descriptive chromatic numbers of locally finite and everywhere two-ended graphs ⋮ FORCING CONSTRUCTIONS AND COUNTABLE BOREL EQUIVALENCE RELATIONS ⋮ Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics ⋮ Definable Kőnig theorems ⋮ Distributed algorithms, the Lovász local lemma, and descriptive combinatorics ⋮ Borel asymptotic dimension and hyperfinite equivalence relations ⋮ Marked groups with isomorphic Cayley graphs but different Borel combinatorics ⋮ MEASURABLE PERFECT MATCHINGS FOR ACYCLIC LOCALLY COUNTABLE BOREL GRAPHS ⋮ Hyperfiniteness and Borel combinatorics ⋮ Measurable versions of the Lovász local lemma and measurable graph colorings ⋮ On Baire measurable colorings of group actions ⋮ Local coloring problems on smooth graphs
This page was built for publication: A bound on measurable chromatic numbers of locally finite Borel graphs
