Trees with many leaves in tournaments

DOI10.1016/J.JCTB.2024.10.001MaRDI QIDQ6652097FDOQ6652097

Authors: Alistair Benford, Richard Montgomery 

Publication date: 12 December 2024

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

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

zbMATH Keywords

regularity lemmadirected graphtournamentoriented tree

Mathematics Subject Classification ID

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

Cites Work

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

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)