Trees with three leaves are (\(n+1\))-unavoidable
From MaRDI portal
Publication:1827852
DOI10.1016/S0166-218X(03)00366-4zbMath1043.05057OpenAlexW1976444262MaRDI QIDQ1827852
Publication date: 6 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00366-4
Related Items (6)
Trees with few leaves in tournaments ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Unnamed Item ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Tournaments and Semicomplete Digraphs
Cites Work
- Unnamed Item
- On unavoidability of trees with \(k\) leaves
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- On avoidable and unavoidable claws
- Paths and Cycles in Tournaments
- Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
- Trees in tournaments
- Trees in tournaments
This page was built for publication: Trees with three leaves are (\(n+1\))-unavoidable