Students will learn what tournament graphs are, and see some examples and non-examples (video). Then students will learn what makes a tournament graph transitive, and again, see some examples and non-examples (video). After that, students will learn why a tournament graph is transitive if and only if it has no cycles (video). Finally, students will learn why all tournaments contain a Hamiltonian path (video).