This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area.

We prove that a properly edge-coloured complete graph Kn has a Hamilton circuit with edges of at least n - √2n distinct colours. This is proved with a method inspired by work on long partial ...