A note on the ErdH{o}s-Hajnal property for stable graphs
classification
🧮 math.LO
math.CO
keywords
graphsnotepropertys-hajnalstableconjecturefamiliesfinite
read the original abstract
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. Malliaris and S. Shelah in "Regularity lemmas for stable graphs", Transactions AMS, 366, 2014, 1551-1585.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.