Trees in tournaments

DOI10.1016/S0012-365X(00)00463-5MaRDI QIDQ5957701zbMATH OpenFDO

Authors Frédéric Havet

Publication date 24 October 2002

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphoriented tree

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• On the unavoidability of oriented trees
• Trees in tournaments
• On unavoidability of trees with k leaves
• Trees with three leaves are \((n+1)\)-unavoidable
• Unavoidable trees in tournaments

Cited in

(16)

• Trees contained in every orientation of a graph
• An approximate version of Sumner's universal tournament conjecture
• Trees in tournaments
• A proof of Sumner's universal tournament conjecture for large tournaments
• Trees in tournaments
• Unavoidable subtrees
• Unavoidable trees in tournaments
• Trees with three leaves are (\(n+1\))-unavoidable
• Ramsey numbers of sparse digraphs
• Trees with few leaves in tournaments
• Orientation Ramsey thresholds for cycles and cliques
• Trees with many leaves in tournaments
• On the unavoidability of oriented trees
• On the unavoidability of oriented trees
• Trees with three leaves are \((n+1)\)-unavoidable
• scientific article; zbMATH DE number 3902685 (Why is no real title available?)

This page was built for publication: Trees in tournaments

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