On the unavoidability of oriented trees

DOI10.1016/j.entcs.2019.08.038OpenAlexW2978202392WikidataQ113317394 ScholiaQ113317394MaRDI QIDQ5918670

Frédéric Havet, François Dross

Publication date: 27 April 2022

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.038

zbMATH Keywords

Ramsey theorytournamentoriented treesunavoidability

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (1)

Trees with few leaves in tournaments

Cites Work

• 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
• Trees in tournaments
• Trees in tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments
• Trees in tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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