Computable vs. Descriptive Combinatorics of Local Problems

12.06.2024 11:30 - 13:00

F. Weilacher (Carnegie Mellon U, Pittsburgh, US)

We consider "local" combinatorial problems on graphs. I.e, problems in which we seek a global labelling of vertices, edges, etc. satisfying some set of local constraints. Typical examples include proper coloring and perfect matching. We are moreover interested in finding solutions which are in some sense "constructive" or "definable".

We will focus on two specializations of this: finding Baire measurable solutions for Borel graphs on Polish spaces, and finding computable solutions for computable graphs on the natural numbers. Recent investigations have uncovered a large number of similarities between these two settings, but there are interesting questions about how deep the relationship really is. We will attempt to survey some recent positive and negative results in this direction.

Includes joint work with Bernshteyn, Bowen, Conley, Lyons, and Qian.




SR 10, 1. Stock, Koling. 14-16, 1090 Wien