JOSÉ DE JESÚS PELAYO-GÓMEZ

The measure half of the 2n+1 problem

Let F_0,...,F_{n-1} be Borel self-maps of a standard Borel space X, and let G_F be the graph they generate. We prove that the total measurable chromatic number of G_F is at most 2n+1 for every n, answering the measure half of Problem 5.14 of Kechris and Marks with the optimal con...