On the unavoidability of oriented trees

DOI10.1016/J.JCTB.2021.06.003zbMath1472.05062arXiv1812.05167OpenAlexW3174618856MaRDI QIDQ5918100

François Dross, Frédéric Havet

Publication date: 16 September 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.05167

zbMATH Keywords

tournamentoriented treeunavoidability

Mathematics Subject Classification ID

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

Related Items (2)

Trees contained in every orientation of a graph ⋮ Orientation Ramsey Thresholds for Cycles and Cliques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate version of Sumner's universal tournament conjecture
• Realization of certain generalized paths in tournaments
• On unavoidability of trees with \(k\) leaves
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Trees with three leaves are (\(n+1\))-unavoidable
• Parity of paths and circuits in tournaments
• A proof of Sumner's universal tournament conjecture for large tournaments
• Paths and Cycles in Tournaments
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• Unavoidable trees in tournaments
• Trees in tournaments
• Trees in tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments
• Trees in tournaments

This page was built for publication: On the unavoidability of oriented trees