Trees in tournaments

zbMATH Open1412.05037MaRDI QIDQ2816100FDOQ2816100

Authors: Frédéric Havet 

Publication date: 1 July 2016

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305801532?np=y

Recommendations

• On unavoidability of trees with \(k\) leaves
• Trees in tournaments
• Trees with three leaves are (\(n+1\))-unavoidable
• On the unavoidability of oriented trees
• Unavoidable trees in tournaments

zbMATH Keywords

tournamentunavoidable

Mathematics Subject Classification ID

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

Cited In (6)

• Trees with three leaves are (\(n+1\))-unavoidable
• A proof of Sumner's universal tournament conjecture for large tournaments
• An approximate version of Sumner's universal tournament conjecture
• Trees in tournaments
• Title not available (Why is that?)
• Unavoidable trees in tournaments

This page was built for publication: Trees in tournaments

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