Trees in tournaments
From MaRDI portal
Publication:5957701
DOI10.1016/S0012-365X(00)00463-5zbMATH Open0995.05037MaRDI QIDQ5957701FDOQ5957701
Publication date: 24 October 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cited In (14)
- Trees with three leaves are (\(n+1\))-unavoidable
- Trees in tournaments
- An approximate version of Sumner's universal tournament conjecture
- Trees with few leaves in tournaments
- Trees contained in every orientation of a graph
- Trees with three leaves are \((n+1)\)-unavoidable
- Orientation Ramsey Thresholds for Cycles and Cliques
- Ramsey numbers of sparse digraphs
- A proof of Sumner's universal tournament conjecture for large tournaments
- Trees with many leaves in tournaments
- Title not available (Why is that?)
- Directed Ramsey number for trees
- On the unavoidability of oriented trees
- On the unavoidability of oriented trees
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)