Finding trees in tournaments

Maths puzzle diagram featuring a set of four tournaments, each with a tree in themYes, you can indeed find the tree in each tournament. Furthermore, the tree T shown is *unavoidable*, meaning that it can be found in every tournament on the same number of vertices (5 in this case). Recent research by Richard Mycroft and Tassio Naia (both School of Mathematics, University of Birmingham) proved that almost all trees have this property, confirming a 1988 conjecture of Bender and Wormald.

To find out more about cutting-edge mathematics research at the University of Birmingham, please follow the link below:

School of Mathematics Research