Tue, 24 Feb 2026, 1:25 pm MT
Descriptive combinatorics is a field concerned with graph theoretic problems on nice (definable) infinite graphs. In this first half of the talk, I will introduce the field of descriptive combinatorics and discuss some of the basic results of the area. Then, I will turn to the descriptive version of complexity problems, in particular, the CSP Dichotomy: it turns out that the finitary complexity landscape is only partially reflected in the descriptive context.