Jørgen Bang-Jensen

A digraph is semicomplete if it has no pair of non-adjacent vertices. A tournament is a semicomplete digraph with no directed 2-cycles. Tournaments form the most well studied class of directed graphs and a lot is known about their structure, ranging...