skip to main content
Caltech

Logic Seminar

Wednesday, May 3, 2023
12:00pm to 1:00pm
Add to Cal
Online Event
Measurable Vizing's theorem
Jan Grebík, Mathematics Institute, University of Warwick,

Please note that the time is PST

Vizing's theorem asserts that every graph of degree bounded by Δ<+∞ admits a proper edge coloring with (Δ+1) colors. I will discuss versions of this theorem in the context of measurable graph combinatorics. I will mainly focus on the case when the graph in question is defined on a standard probability space (X,μ). In this situation, a combination of an augmenting chain technique developed earlier with Oleg Pikhurko (that was applied for graphings) together with a new result about quasi-invariant measures allows to deduce a full analogue of Vizing's theorem.

For more information, please contact Math Dept. by phone at 626-395-4335 or by email at A. Kechris at [email protected].