Forcing large transitive subtournaments

DOI10.1016/j.jctb.2014.11.003zbMath1310.05106OpenAlexW1993285331MaRDI QIDQ2343283

Krzysztof Choromanski, Eli Berger, Maria Chudnovsky

Publication date: 4 May 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2014.11.003

zbMATH Keywords

regularity lemmatournamentsErdős-Hajnal conjecturesubstitution operations

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (19)

On the Erdős-Hajnal conjecture for six-vertex tournaments ⋮ Excluding hooks and their complements ⋮ Structure Theorem forU₅-free Tournaments ⋮ Decomposing and colouring some locally semicomplete digraphs ⋮ About the Erdős-Hajnal conjecture for seven-vertex tournaments ⋮ Pure pairs. X. Tournaments and the strong Erdős-Hajnal property ⋮ Four proofs of the directed Brooks' theorem ⋮ Erdös–Hajnal conjecture for new infinite families of tournaments ⋮ Unavoidable tournaments ⋮ 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 ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ The Erdös--Hajnal Conjecture for Long Holes and Antiholes ⋮ Coloring tournaments: from local to global ⋮ Tournaments and the strong Erdős-Hajnal property ⋮ EH-suprema of tournaments with no nontrivial homogeneous sets ⋮ The Erdös-Hajnal Conjecture-A Survey

Cites Work

• Tournaments and colouring
• The Voting Problem
• Graph Minors I: A Short Proof of the Path-width Theorem
• Testing subgraphs in directed graphs
• Ramsey-type theorems with forbidden subgraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Forcing large transitive subtournaments