On the Erdős-Hajnal conjecture for six-vertex tournaments

DOI10.1016/j.ejc.2018.08.007zbMath1400.05096arXiv1508.04992OpenAlexW2963106480WikidataQ123186887 ScholiaQ123186887MaRDI QIDQ1621068

Maria Chudnovsky, Eli Berger, Krzysztof Choromanski

Publication date: 15 November 2018

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

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

About the Erdős-Hajnal conjecture for seven-vertex tournaments ⋮ Pure pairs. X. Tournaments and the strong Erdős-Hajnal property ⋮ Erdös–Hajnal conjecture for new infinite families of tournaments ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ Forests and the strong Erdős-Hajnal property ⋮ Forbidding couples of tournaments and the Erdös-Hajnal conjecture ⋮ Unnamed Item ⋮ A tournament approach to pattern avoiding matrices ⋮ Tournaments and the strong Erdős-Hajnal property

Cites Work

• Ramsey-type theorems
• Forcing large transitive subtournaments
• EH-suprema of tournaments with no nontrivial homogeneous sets
• Ramsey-type theorems with forbidden subgraphs

This page was built for publication: On the Erdős-Hajnal conjecture for six-vertex tournaments