Caltech Home > PMA Home > Calendar > Logic Seminar
open search form
Wednesday, February 09, 2022
12:00 PM - 1:00 PM
Online Event

Logic Seminar

Measurable combinatorics in hyperfinite graphs
Matthew Bowen, McGill University,

We discuss a few new results concerning the descriptive combinatorics of bounded degree hyperfinite Borel graphs. In particular, we show that the Baire measurable edge chromatic number of G is at most ⌈32Δ(G)⌉+6 when G is a multigraph, and for bipartite graphs we improve this bound to Δ(G)+1 and show that degree regular one-ended bipartite graphs have Borel perfect matchings generically. Similar results hold in the measure setting assuming some hyperfiniteness conditions. This talk is based on joint work with Kun and Sabok, Weilacher, and upcoming work with Poulin and Zomback.

For more information, please contact Math Dept. by phone at 626-395-4335 or by email at A. Kechris at kechris@caltech.edu.