Pierre Simon: Introduction to model theory and stability
Sparse graphs satisfy a strong model-theoretic condition called stability. In those lectures, I will introduce first-order logic and basic results of model theory, then define stability (as well as possibly other classes) and discuss its aspects most relevant to combinatorics.
