19 citations · 71 across the 32 of their papers we have counts for
4 papers · 2 filters
Regularity lemma for distal structures
Artem Chernikov, Sergei Starchenko
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…
On model-theoretic tree properties
Artem Chernikov, Nicholas Ramsey
We study model theoretic tree properties () and their associated cardinal invariants (, respect…
A note on the Erdős-Hajnal property for stable graphs
Artem Chernikov, Sergei Starchenko
In this short note we provide a relatively simple proof of the Erdős-Hajnal conjecture for families of finite (hyper-)graphs without the -order property. It was originally prove…
Definably amenable NIP groups
Artem Chernikov, Pierre Simon
We study definably amenable NIP groups. We develop a theory of generics, showing that various definitions considered previously coincide, and study invariant measures. Applications…