Trees in tournaments

DOI10.1016/j.jctb.2004.04.002zbMath1048.05040OpenAlexW2101203255MaRDI QIDQ5917541

Amine El Sahili

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.04.002

zbMATH Keywords

tournamentoriented tree

Mathematics Subject Classification ID

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

Related Items (14)

Trees with few leaves in tournaments ⋮ Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star ⋮ A Ramsey type result for oriented trees ⋮ Paths with two blocks in \(n\)-chromatic digraphs ⋮ \(k\)-ary spanning trees contained in tournaments ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Unnamed Item ⋮ Directed Ramsey number for trees ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Parity of paths in tournaments ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Orientation Ramsey Thresholds for Cycles and Cliques

Cites Work

• Paths with two blocks in \(k\)-chromatic digraphs
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• Trees in tournaments
• Trees in tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees in tournaments