Sumner's conjecture (also called Sumner's universal tournament conjecture) is a conjecture in extremal graph theory on oriented trees in tournaments. It states that every orientation of every n {\displaystyle n} -vertex tree is a subgraph of every ( 2 n − 2 ) {\displaystyle (2n-2)} -vertex tournament.
Sumner's conjecture (also called Sumner's universal tournament conjecture) is a conjecture in extremal graph theory on oriented trees in tournaments. It states that every orientation of every n {\displaystyle n} -vertex tree is a subgraph of every ( 2 n − 2 ) {\displaystyle (2n-2)} -vertex tournament.
Source: Wikipedia "Sumner's conjecture" · CC BY-SA 4.0
Share this article: X · Bluesky