Notes on the stable regularity lemma
M. Malliaris, S. Shelah

TL;DR
This paper provides an accessible overview of the stable regularity lemma for graphs, highlighting its proof and model theoretic context for a broad logical audience.
Contribution
It offers a clear exposition of the stable regularity lemma and discusses its implications within model theory, making the results more accessible.
Findings
The stable regularity lemma applies to stable graphs.
The authors present a simplified proof of the lemma.
Comments connect the lemma to model theoretic concepts.
Abstract
This is a short expository account of the regularity lemma for stable graphs proved by the authors, with some comments on the model theoretic context, written for a general logical audience.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Limits and Structures in Graph Theory · Advanced Graph Theory Research
