Measurable combinatorics studies the behavior of infinite definable graphs and measurable analogues of notions of classical combinatorics. Imposing definability/measurability restrictions on the objects in question often yield more intuitive behavior, eliminating the examples constructed using, e.g., the axiom of choice. In the past couple of years the area has been extremely active with a myriad of connections to other fields, such as dynamics, probability theory, combinatorics, and even theoretical computer science. The aims of the mini-semester are to bring together the students and leading experts of the area and to create an opportunity for cooperation with researchers of related fields.
