English

Measurable Vizing's theorem

Logic 2024-07-30 v3

Abstract

We prove a full measurable version of Vizing's theorem for bounded degree Borel graphs, that is, we show that every Borel graph G\mathcal{G} of degree uniformly bounded by ΔN\Delta\in \mathbb{N} defined on a standard probability space (X,μ)(X,\mu) admits a μ\mu-measurable proper edge coloring with (Δ+1)(\Delta+1)-many colors. This answers a question of Marks [Question 4.9, J. Amer. Math. Soc. 29 (2016)] also stated in Kechris and Marks as a part of [Problem 6.13, survey (2020)], and extends the result of the author and Pikhurko [Adv. Math. 374, (2020)] who derived the same conclusion under the additional assumption that the measure μ\mu is G\mathcal{G}-invariant.

Keywords

Cite

@article{arxiv.2303.16440,
  title  = {Measurable Vizing's theorem},
  author = {Jan Grebík},
  journal= {arXiv preprint arXiv:2303.16440},
  year   = {2024}
}

Comments

We were informed by Gabor Elek that our result about bounded cocycle (Theorem 1.2) was previously established by Gabriella Kuhn. Reference and discussion of this result has been added

R2 v1 2026-06-28T09:39:12.209Z