Tournaments with near-linear transitive subsets

DOI10.1016/J.JCTB.2014.06.007zbMATH Open1301.05145OpenAlexW2133170267MaRDI QIDQ462934FDOQ462934

Authors: Krzysztof Choromanski, Maria Chudnovsky, Paul 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

Recommendations

• Upper bounds for Erdös-Hajnal coefficients of tournaments
• Tournaments and the strong Erdős-Hajnal property
• Forcing large transitive subtournaments
• Excluding pairs of tournaments
• scientific article; zbMATH DE number 7731176

zbMATH Keywords

tournamentsErdős-Hajnal conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Title not available (Why is that?)
• The Voting Problem
• Title not available (Why is that?)
• Ramsey-type theorems
• Title not available (Why is that?)
• Ramsey-type theorems with forbidden subgraphs
• Tournaments and colouring
• Upper bounds for Erdös-Hajnal coefficients of tournaments

Cited In (16)

• Structure theorem for \(U_{5}\)-free tournaments
• Tiling transitive tournaments and their blow-ups
• The Erdős-Hajnal conjecture. A survey
• On Convex Subsets in Tournaments
• Coloring dense digraphs
• Title not available (Why is that?)
• Stable sets of weak tournaments
• Excluding hooks and their complements
• Transitive convex subsets in large tournaments
• Packing transitive triples in a tournament
• Upper bounds for Erdös-Hajnal coefficients of tournaments
• On the functional completeness of simple tournaments
• Coloring tournaments: from local to global
• Title not available (Why is that?)
• On tournaments and their largest transitive subtournaments
• A tournament approach to pattern avoiding matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q462934)