Stability and Combinatorics in Pure Model Theory - Lecture 11
Offered By: Fields Institute via YouTube
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
Intermediate Network Analysis in PythonDataCamp Discriminative Prototype Selection for Graph Embedding
University of Central Florida via YouTube Canonical Structures Inside Platonic Solids II - Universal Hyperbolic Geometry
Insights into Mathematics via YouTube More on Graphs and Euler's Formula in Algebraic Topology - Lecture 10
Insights into Mathematics via YouTube The Multinomial Dimer Model - Statistical Mechanics and Discrete Geometry
Institute for Pure & Applied Mathematics (IPAM) via YouTube