A Note on "Regularity lemma for distal structures"
Logic
2015-08-18 v1 Combinatorics
Abstract
In a recent paper, Chernikov and Starchenko prove that graphs defined in distal theories have strong regularity properties, generalizing previous results about graphs defined by semi-algebraic relations. We give a shorter, purely model-theoretic proof of this fact.
Cite
@article{arxiv.1508.03955,
title = {A Note on "Regularity lemma for distal structures"},
author = {Pierre Simon},
journal= {arXiv preprint arXiv:1508.03955},
year = {2015}
}
Comments
6 pages