Definable Kőnig theorems

DOI10.1090/proc/16355arXiv2112.10222OpenAlexW4311486556WikidataQ122909357 ScholiaQ122909357MaRDI QIDQ6095830

Felix Weilacher, Matthew Bowen

Publication date: 8 September 2023

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Descriptive set theory (03E15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Ends of graphed equivalence relations. I
• Borel chromatic numbers
• Measurable versions of Vizing's theorem
• Descriptive chromatic numbers of locally finite and everywhere two-ended graphs
• Hyperfiniteness and Borel combinatorics
• Measurable versions of the Lovász local lemma and measurable graph colorings
• A bound on measurable chromatic numbers of locally finite Borel graphs
• A determinacy approach to 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

This page was built for publication: Definable Kőnig theorems