YoVDO

Stability and Combinatorics in Pure Model Theory - Lecture 11

Offered By: Fields Institute via YouTube

Tags

Combinatorics Courses Graph Theory Courses Bipartite Graphs Courses Stability Theory Courses

Course Description

Overview

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.

Syllabus

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


Taught by

Fields Institute

Related Courses

Solving Systems of Differential Equations with Eigenvalues and Eigenvectors
Steve Brunton via YouTube Topics in Applied Model Theory - Lecture 7
Fields Institute via YouTube Wasserstein Distributionally Robust Optimization - Theory and Applications in Machine Learning
Institute for Pure & Applied Mathematics (IPAM) via YouTube Model Theory - From Logic to Geometric Stability Theory and O-Minimality I
IMSA via YouTube L-P Metrics on Multiparameter Persistence Modules
Applied Algebraic Topology Network via YouTube