Caltech Logo

Logic Seminar

Wednesday, August 5, 2020
12:00pm to 1:00pm
Add to Cal
Online Event
Equitable colorings of Borel graphs
Clinton Conley, Department of Mathematical Sciences, Carnegie Mellon University,

A proper coloring of a graph is called equitable if every color class has (approximately) the same number of vertices. In the finite setting, the celebrated Hajnal–Szemerédi theorem establishes the existence of equitable (d+1)(d+1)-colorings, where dd is a bound on the vertex degrees. We discuss the existence of equitable (d+1)(d+1)-colorings in the measure-theoretic and purely Borel contexts. Time permitting, we also discuss measure-theoretic analogs of recent work of Kostochka-Nakprasit on the existence of equitable dd-colorings for graphs of low average degree. This is joint work with Anton Bernshteyn.

For more information, please contact Math Department by phone at 626-395-4335 or by email at