NOTES ON THE STABLE REGULARITY LEMMA
From MaRDI portal
Publication:5037518
DOI10.1017/bsl.2021.69OpenAlexW4205630085WikidataQ124814909 ScholiaQ124814909MaRDI QIDQ5037518
Saharon Shelah, Maryanthe Malliaris
Publication date: 1 March 2022
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.09794
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge distribution and density in the characteristic sequence
- Classification theory and the number of non-isomorphic models
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Bounds for graph regularity and removal lemmas
- Keisler's order is not simple (and simple theories may not be either)
- Regularity partitions and the topology of graphons
- On sets of integers containing k elements in arithmetic progression
- The Algorithmic Aspects of the Regularity Lemma
- On unavoidable‐induced subgraphs in large prime graphs
- Stable arithmetic regularity in the finite field model
- Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
- Regularity lemmas for stable graphs
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
This page was built for publication: NOTES ON THE STABLE REGULARITY LEMMA
