All week two lectures will be given in CoRE A, Room 301.
Tournaments and closely related digraphs continue to generate interesting problems and applications. Some of these topics include orientations of Hamilton paths, feedback arc and vertex sets, linear ordering problems, realizations of tournaments and specific score sequences, trees in tournaments (generalizing kings), etc. Applications include ranking of paired comparison digraphs and related voting applications, feedback sets in engineering and alternating Hamiltonian cycles in genetics.