Thomas Kim of UIC : Coloring Borel Graphs

Posted by Hazal Sena Aydogdu , part of the Louise Hay Logic Seminar.

At

Sept. 30, 2026, 11 a.m.

In

427 SEO

Abstract

In graph theory, people like to color edges and vertices of finite graphs. In 1999 Kechris, Solecki, and Todorčević tried coloring Borel graphs in a Borel way. This yielded many interesting results which deeply influenced descriptive set theory. In this talk we show a few of their more fun, lighthearted results. In particular, we color edges of locally countable Borel graphs and use that to color vertices of locally finite Borel graphs.