Stability and Combinatorics in Pure Model Theory - Lecture 11

Explore the intersection of stability theory and combinatorics in this lecture by Gabriel Conant from The Ohio State University. Delve into topics such as stable graph regularity, intuition behind stability, and the properties of stable graphs. Examine bipartite graphs and their role in this context, and gain insights into homogeneity and function control. Part of the "Topics in Pure Model Theory" series at the Fields Institute, this talk offers a deep dive into the mathematical foundations connecting stability and combinatorial structures.

Introduction
Overview stable graph regularity
Intuition
Stability
Stable graphs
Bipartite graphs
Remarks
Homogeneity
Function control
Break