EH-suprema of tournaments with no nontrivial homogeneous sets

DOI10.1016/j.jctb.2015.04.002zbMath1315.05065OpenAlexW1983304967MaRDI QIDQ2349509

Krzysztof Choromanski

Publication date: 22 June 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.2015.04.002

zbMATH Keywords

random graphsregularity lemmatournamentshomogeneous setsErdős-Hajnal conjecturemodular partitionsEH-supremaquotient tournaments

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

On the Erdős-Hajnal conjecture for six-vertex tournaments ⋮ Excluding hooks and their complements ⋮ 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 ⋮ Unavoidable tournaments ⋮ Forests and the strong Erdős-Hajnal property ⋮ Forbidding couples of tournaments and the Erdös-Hajnal conjecture ⋮ Unnamed Item

Cites Work

• Tournaments and colouring
• Forcing large transitive subtournaments
• Upper Bounds for Erdös-Hajnal Coefficients of Tournaments
• Graph Minors I: A Short Proof of the Path-width Theorem
• Ramsey-type theorems with forbidden subgraphs
• Unnamed Item

This page was built for publication: EH-suprema of tournaments with no nontrivial homogeneous sets