# Regularity lemma for distal structures

@article{Chernikov2015RegularityLF, title={Regularity lemma for distal structures}, author={Artem Chernikov and Sergei Starchenko}, journal={Journal of the European Mathematical Society}, year={2015} }

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to a small error (e.g., see [33, 2, 16, 18]). We show that similar results can be obtained for families of graphs with the edge relation uniformly definable in a structure satisfying a certain model theoretic property called distality, with respect to a large…

## 49 Citations

### Stable regularity for relational structures

- Mathematics
- 2017

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the…

### Definable Regularity Lemmas for NIP Hypergraphs

- MathematicsThe Quarterly Journal of Mathematics
- 2016

We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version…

### Regular partitions of gentle graphs

- Mathematics, Computer ScienceArXiv
- 2020

This work surveys several refinements of Szemerédi's Regularity Lemma for special, more structured classes of graphs and stresses the link to the theory of (structural) sparsity, which leads to alternative proofs, refinements and solutions of open problems.

### Cutting lemma and Zarankiewicz’s problem in distal structures

- MathematicsSelecta Mathematica
- 2020

A cutting lemma is established for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definite families of set on the plane in o-minimal expansions of fields, which generalizes the results in Fox et al.

### Cutting lemma and Zarankiewicz’s problem in distal structures

- MathematicsSelecta Mathematica
- 2020

We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in o-minimal…

### Title Definable regularity lemmas for NIP hypergraphs Permalink

- Mathematics
- 2016

We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of…

### VC-density and abstract cell decomposition for edge relation in graphs of bounded twin-width

- Mathematics, Computer ScienceArXiv
- 2022

It is proved that such classes of graphs admit linear neighborhood complexity, in analogy to previous results concerning classes with bounded expansion and classes of bounded clique-width, and that this fact can apply to such classes combinatorial tools based on the Distal cutting lemma and thedistal regularity lemma.

### Independent sets in algebraic hypergraphs

- MathematicsJournal of the European Mathematical Society
- 2018

In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics, that if a given…

### Removal Lemmas with Polynomial Bounds Lior Gishboliner

- Mathematics
- 2016

A common theme in many extremal problems in graph theory is the relation between local and global properties of graphs. One of the most celebrated results of this type is the Ruzsa-Szemerédi triangle…

### Definable sets containing productsets in expansions of groups

- MathematicsJournal of Group Theory
- 2019

Abstract We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the “productset property”). We first show…

## References

SHOWING 1-10 OF 44 REFERENCES

### Regularity lemmas for stable graphs

- Mathematics
- 2011

We develop a framework in which Szemeredi's celebrated Regularity Lemma for graphs interacts with core model-theoretic ideas and techniques. Our work relies on a coincidence of ideas from model…

### Pseudofinite structures and simplicity

- MathematicsJ. Math. Log.
- 2015

A notion of pseudofinite dimension, introduced by Hrushovski and Wagner, on an infinite ultraproduct of finite structures is explored, and a measure-theoretic condition is shown to be equivalent to local stability.

### Combinatorial complexity in O-minimal geometry

- MathematicsSTOC '07
- 2007

In this paper we prove tight bounds on the combinatorial and topological complexity of sets dened in terms of n denable sets belonging to some fixed denable family of sets in an o-minimal structure.…

### Szemeredi''s Regularity Lemma and its applications in graph theory

- Mathematics
- 1995

Szemer\''edi''s Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be approximated by random-looking graphs. Therefore the lemma helps in…

### THE ERDŐS-HAJNAL PROPERTY FOR STABLE GRAPHS

- Mathematics
- 2018

During the last years, ultraproducts of finite structures have been used to prove results on asymptotic combinatorics. Asymptotic combinatorics (or extremal combinatorics, as probably it is better…

### Generically stable and smooth measures in NIP theories

- Mathematics
- 2010

We formulate the measure analogue of generically stable types in first order theories with NIP (without the independence property), giving several characterizations, answering some questions from…

### Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects

- Mathematics
- 2008

In their seminal paper [21], Erdős and Hajnal raised the following question. Is it true that for any graph G there exists a constant c = c(G) > 0 with the property that every graph of n vertices that…

### A note on the Erd\H{o}s-Hajnal property for stable graphs

- Mathematics
- 2015

In this short note we provide a relatively simple proof of the Erd\H{o}s-Hajnal conjecture for families of finite (hyper-)graphs without the $k$-order property. It was originally proved by M.…