Course term: Trinity
Course lecture information: 8 lectures
Course overview:
This course introduces some central topics in graph theory.
Lecturer(s):
Prof. Peter Keevash
Learning outcomes:
Students should have an appreciation of the flavour of methods and results in graph theory.
Course synopsis:
Introduction. Paths, walks, cycles and trees. Euler circuits. Hall's theorem. Application and analysis of algorithms for minimum cost spanning trees, shortest paths, bipartite matching and the Chinese Postman Problem.