English

Definable K\H{o}nig theorems

Logic 2021-12-21 v1 Combinatorics

Abstract

Let XX be a Polish space with Borel probability measure μ,\mu, and let GG be a Borel graph on XX with no odd cycles and maximum degree Δ(G).\Delta(G). We show that the Baire measurable edge chromatic number of GG is at most Δ(G)+1\Delta(G)+1, and if GG is μ\mu-hyperfinite then the μ\mu-measurable edge chromatic number obeys the same bound. More generally, we show that GG has Borel edge chromatic number at most Δ(G)\Delta(G) plus its asymptotic separation index.

Keywords

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

R2 v1 2026-06-24T08:23:47.094Z