加载中…
We prove a full measurable version of Vizing’s theorem for bounded degree Borel graphs, that is, we show that every Borel graph of degree uniformly bounded by defined on a standard probability space admits a -measurable proper edge coloring with -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 is -invariant.

生成讲解博客的中文版本

生成AI智能校验的中文版本