scientific article; zbMATH DE number 3769649

MaRDI QIDQ3950574zbMATH OpenFDO

Authors K. B. Reid, Nicholas Wormald

Publication date 1983

zbMATH Keywords

containing every orientation of n-treesnear-regular tournamentoriented caterpillaroriented path

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Cited in

(14)

• Trees with three leaves are (\(n+1\))-unavoidable
• Paths with two blocks in k-chromatic digraphs
• Trees with few leaves in tournaments
• A proof of Sumner's universal tournament conjecture for large tournaments
• Paths and Cycles in Tournaments
• Random Trees in Random Graphs
• Trees in tournaments
• Trees in tournaments
• On the unavoidability of oriented trees
• On the unavoidability of oriented trees
• Ramsey numbers for tournaments
• An approximate version of Sumner's universal tournament conjecture
• Trees with many leaves in tournaments
• Blow-ups and extensions of trees in tournaments

This page was built for publication:

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