Regularity lemmas for stable graphs
From MaRDI portal
Publication:5401732
DOI10.1090/S0002-9947-2013-05820-5zbMath1283.05234arXiv1102.3904WikidataQ105983441 ScholiaQ105983441MaRDI QIDQ5401732
Saharon Shelah, Maryanthe Malliaris
Publication date: 12 March 2014
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.3904
05C75: Structural characterization of families of graphs
03C45: Classification theory, stability, and related concepts in model theory
03C98: Applications of model theory
Related Items
A note on the Erdős-Hajnal property for stable graphs, Unnamed Item, On finite sets of small tripling or small alternation in arbitrary groups, Quantitative structure of stable sets in arbitrary finite groups, Infinite stable graphs with large chromatic number, NOTES ON THE STABLE REGULARITY LEMMA, Ramsey properties of algebraic graphs and hypergraphs, MODEL THEORY AND COMBINATORICS OF BANNED SEQUENCES, Graphons arising from graphs definable over finite fields, Quantitative structure of stable sets in finite abelian groups, Semantic limits of dense combinatorial objects, RAMSEY GROWTH IN SOME NIP STRUCTURES, DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS, A group version of stable regularity, On Vapnik‐Chervonenkis density over indiscernible sequences, Combinatorics and algorithms for quasi-chain graphs, Combinatorics and algorithms for quasi-chain graphs, Erdös--Hajnal Properties for Powers of Sparse Graphs, DOMINATION AND REGULARITY, On 3‐graphs with no four vertices spanning exactly two edges, Minimum degree and the graph removal lemma, Stable formulas in ordered structures, Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL, On the complexity of finite subgraphs of the curve graph, Bounds for graph regularity and removal lemmas, A counter-example to the probabilistic universal graph conjecture via randomized communication complexity, Structure and regularity for subsets of groups with finite VC-dimension, On partial cubes, well-graded families and their duals with some applications in graphs, Regular partitions of gentle graphs, Keisler's order is not simple (and simple theories may not be either), Bounds on half graph orders in powers of sparse graphs, The stable regularity lemma revisited, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Normal Approximation to the Hypergeometric Distribution
- Edge distribution and density in the characteristic sequence
- Lower bounds of tower type for Szemerédi's uniformity lemma
- EXAMPLES IN DEPENDENT THEORIES
- The characteristic sequence of a first-order formula
- Regularity partitions and the topology of graphons
- Vapnik-Chervonenkis Classes of Definable Sets
- On sets of integers containing k elements in arithmetic progression
- The Algorithmic Aspects of the Regularity Lemma
- Hypergraph sequences as a tool for saturation of ultrapowers
- Groups, measures, and the NIP
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
