Tournaments with near-linear transitive subsets

DOI10.1016/j.jctb.2014.06.007zbMath1301.05145OpenAlexW2133170267MaRDI QIDQ462934

Krzysztof Choromanski, Maria Chudnovsky, P. D. Seymour

Publication date: 22 October 2014

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.06.007

zbMATH Keywords

tournamentsErdős-Hajnal conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Excluding hooks and their complements ⋮ Structure Theorem forU₅-free Tournaments ⋮ A tournament approach to pattern avoiding matrices ⋮ Coloring dense digraphs ⋮ Coloring tournaments: from local to global ⋮ The Erdös-Hajnal Conjecture-A Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• Tournaments and colouring
• Upper Bounds for Erdös-Hajnal Coefficients of Tournaments
• The Voting Problem
• Ramsey-type theorems with forbidden subgraphs

This page was built for publication: Tournaments with near-linear transitive subsets