Graph Theory

3 credits · Graduate Programs

Discrete Geometry: Euclidean, spherical and hyperbolic n-spaces, trigonometry, isometries, convex sets, convex polytopes, (mixed) volume(s), classical discrete groups, tilings, isoperimetric inequalities, packings, coverings. Graph Theory: connectivity; trees; Euler trails and tours; Hamilton cycles and paths; matchings; edge colourings; vertex colourings; homomorphisms; plane and planar graphs; extremal graph theory and Ramsey theory. Prerequisite(s): Admission to a graduate program in Mathematics and Statistics or consent of the Department.