A note on the Erdős-Hajnal property for stable graphs
From MaRDI portal
Publication:4596007
Abstract: In this short note we provide a relatively simple proof of the ErdH{o}s-Hajnal conjecture for families of finite (hyper-)graphs without the -order property. It was originally proved by M. Malliaris and S. Shelah in "Regularity lemmas for stable graphs", Transactions AMS, 366, 2014, 1551-1585.
Recommendations
Cites work
Cited in
(9)- Stability of the Haagerup property under graph products
- On 3‐graphs with no four vertices spanning exactly two edges
- Ramsey properties of algebraic graphs and hypergraphs
- A remark on the stability of saturated generic graphs
- Stable formulas in ordered structures
- Transducing paths in graph classes with unbounded shrubdepth
- A Gallai’s Theorem type result for the edge stability of graphs
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
- Ramsey growth in some NIP structures
This page was built for publication: A note on the Erdős-Hajnal property for stable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596007)