Definable K\H{o}nig theorems
Logic
2021-12-21 v1 Combinatorics
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.
Cite
@article{arxiv.2112.10222,
title = {Definable K\H{o}nig theorems},
author = {Matt Bowen and Felix Weilacher},
journal= {arXiv preprint arXiv:2112.10222},
year = {2021}
}
Comments
6 pages