Trees with many leaves in tournaments

DOI10.1016/J.JCTB.2024.10.001MaRDI QIDQ6652097zbMATH OpenFDO

Authors Alistair Benford, Richard Montgomery

Publication date 12 December 2024

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.2024.10.001

zbMATH Keywords

directed graphoriented treeregularity lemmatournament

Mathematics Subject Classification ID

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

Recommendations

• Trees with few leaves in tournaments
• An approximate version of Sumner's universal tournament conjecture
• Trees in tournaments
• A proof of Sumner's universal tournament conjecture for large tournaments
• A proof of Sumner's universal tournament conjecture for large tournaments

Cites work

• A proof of Sumner's universal tournament conjecture for large tournaments
• An approximate version of Sumner's universal tournament conjecture
• Embedding rainbow trees with applications to graph labelling and decomposition
• scientific article; zbMATH DE number 3769649 (Why is no real title available?)
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• On the unavoidability of oriented trees
• On unavoidability of trees with k leaves
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Paths and Cycles in Tournaments
• Spanning trees in dense directed graphs
• Testing subgraphs in directed graphs
• Trees in tournaments
• Trees in tournaments
• Trees in tournaments
• Trees with few leaves in tournaments
• Unavoidable trees in tournaments

Cited in

(1)

• Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs

This page was built for publication: Trees with many leaves in tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652097)