Definable Konig theorems

Abstract

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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…