2000 character limit reached
A note on the Erdős-Hajnal property for stable graphs
Published 30 Apr 2015 in math.LO and math.CO | (1504.08252v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.