Combinatorics Seminar

Tournaments are orientations of complete graphs, and many graph theory questions -- in particular, from the world of induced subgraphs -- have analogues in tournaments. In particular, notions of colouring (due to Neumann-Lara) and clique number (Aboulker, Aubian, Charbit, Lopes) exist. I will tell you what these are, as well as some of what we know about them, and questions that remain.