Definable Kőnig theorems
From MaRDI portal
Abstract: Let be a Polish space with Borel probability measure and let be a Borel graph on with no odd cycles and maximum degree We show that the Baire measurable edge chromatic number of is at most , and if is -hyperfinite then the -measurable edge chromatic number obeys the same bound. More generally, we show that has Borel edge chromatic number at most plus its asymptotic separation index.
Cites work
- A bound on measurable chromatic numbers of locally finite Borel graphs
- A determinacy approach to Borel combinatorics
- Borel chromatic numbers
- Descriptive chromatic numbers of locally finite and everywhere two-ended graphs
- Ends of graphed equivalence relations. I
- Hyperfiniteness and Borel combinatorics
- Kőnig's line coloring and Vizing's theorems for graphings
- Marked groups with isomorphic Cayley graphs but different Borel combinatorics
- Measurable perfect matchings for acyclic locally countable Borel graphs
- Measurable versions of the Lovász local lemma and measurable graph colorings
- Measurable versions of Vizing's theorem
Cited in
(7)- Effective definability of Kolchin polynomials
- Borel Vizing's theorem for graphs of subexponential growth
- Borel versions of the local lemma and local algorithms for graphs of finite asymptotic separation index
- The uniform Gardner conjecture and rounding Borel flows
- Large-scale geometry of Borel graphs of polynomial growth
- Measurable Vizing's theorem
- Embedding Borel graphs into grids of asymptotically optimal dimension
This page was built for publication: Definable Kőnig theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6095830)