A note on the Erdős-Hajnal property for stable graphs

DOI10.1090/proc/13626zbMath1477.03131arXiv1504.08252OpenAlexW2963198117MaRDI QIDQ4596007

Artem Chernikov, Sergei Starchenko

Publication date: 8 December 2017

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.08252

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Classification theory, stability, and related concepts in model theory (03C45)

Related Items (5)

Ramsey properties of algebraic graphs and hypergraphs ⋮ On 3‐graphs with no four vertices spanning exactly two edges ⋮ Stable formulas in ordered structures ⋮ RAMSEY GROWTH IN SOME NIP STRUCTURES ⋮ A counter-example to the probabilistic universal graph conjecture via randomized communication complexity

Cites Work

• On pseudo-finite dimensions
• Ramsey-type theorems
• Classification theory and the number of non-isomorphic models.
• Regularity lemma for distal structures
• The Erdös-Hajnal Conjecture-A Survey
• Regularity lemmas for stable graphs
• Induced Ramsey-type theorems

This page was built for publication: A note on the Erdős-Hajnal property for stable graphs