skip to main content

Logic Seminar

Thursday, June 11, 2020
12:00pm to 1:00pm
Add to Cal
Online Event
Descriptive chromatic numbers of locally finite and everywhere two-ended graphs
Felix Weilacher, Department of Mathematical Sciences, Carnegie Mellon University,

We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include "Can the Baire measurable chromatic number of a locally finite Borel graph exceed the usual chromatic number by more than one?" and "Can marked groups with isomorphic Cayley graphs have Borel chromatic numbers for their shift graphs which differ by more than one?". As a result, we completely determine the set of pairs (x,y) such that there exists a locally finite Borel graph with usual chromatic number x and Baire measurable chromatic number y.

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