Tournaments and the strong Erdős-Hajnal property

DOI10.1016/j.ejc.2021.103440zbMath1479.05127arXiv2002.07248OpenAlexW3205627453MaRDI QIDQ2065123

Shira Zerbib, Eli Berger, Maria Chudnovsky, Krzysztof Choromanski

Publication date: 7 January 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Hajnal conjectureAlon-Pach-Solymosi conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Pure pairs. X. Tournaments and the strong Erdős-Hajnal property ⋮ Forests and the strong Erdős-Hajnal property ⋮ Pure pairs. I: Trees and linear anticomplete pairs ⋮ A tournament approach to pattern avoiding matrices

Cites Work

• Ramsey-type theorems
• On the Erdős-Hajnal conjecture for six-vertex tournaments
• Pure pairs. I: Trees and linear anticomplete pairs
• Forcing large transitive subtournaments
• Parameterized Algorithms
• Ramsey-type theorems with forbidden subgraphs
• Unnamed Item

This page was built for publication: Tournaments and the strong Erdős-Hajnal property