Module manager: Dr Paul Shafer
Email: p.e.shafer@leeds.ac.uk
Taught: Semester 1 (Sep to Jan) View Timetable
Year running 2024/25
(MATH2210 or MATH2230 or MATH2231) or COMP2721 or COMP2941, or equivalent.
| MATH5033M | Advanced Graph Theory |
This module is not approved as an Elective
Graph theory is an important mathematical tool in many different areas, including linguistics, chemistry, operational research and computer science. The subject has a distinctive flavour in that many definitions are pictorially intuitive and can be stated easily. This allows us to state and tackle problems, including the famous puzzle of the bridges of Königsberg, quite rapidly. In the module, we will cover the basic ideas of graph theory, such as connectedness, trees, planar graphs, Eulerian and Hamiltonian graphs and the four colour problem. This will often involve translating intuitive ideas into mathematical proofs.
To introduce students to some of the main concepts and modeling usefulness of graph theory, and to develop their ability to reason graph theoretically.
On completion of this module, students should be able to:
(a) identify basic examples of isomorphic and non-isomorphic pairs of graphs, and make simple deductions involving vertex degrees, connectedness and bipartite graphs;
(b) apply a selection of criteria related to Eulerian and Hamiltonian graphs;
(c) explain and apply the basic theorems for trees and planar graphs;
(d) understand and apply basic graph theoretic search algorithms, for example to find the block graph of a graph;
(e) show a knowledge of graph colourings of various types, and apply a range of techniques for identifying chromatic numbers for graphs.
A selection of topics from the following:
1. Basic definitions, vertex degrees, special kinds of graphs (e.g. complete, bipartite; regular).
2. Paths and cycles, connected graphs, trees.
3. Multiple connectivity, Menger’s Theorem, cut vertices and blocks, block graphs.
4. Eulerian graphs and applications, Hamiltonian graphs, including Dirac's theorem and techniques for identifying non-Hamiltonian graphs.
5. Combinatorial aspects, Cayley’s theorem, matchings, Hall’s theorem.
6. Planar graphs, Euler's theorem, Kuratowski's theorem (without proof).
7. Colourability, Graph colouring, the five-colour theorem for planar graphs, the four-colour theorem for planar graphs (without proof), Brook's theorem, edge colourings, Tait colourings, chromatic numbers of surfaces, applications of the Euler characteristic, Heawood's inequality and the map colour theorem.
8. Algebraic graph theory, adjacency matrices, strongly regular graphs, Friendship Theorem, matrix-tree theorem.
9. Digraphs, strong connectedness, Robbins’ Theorem, Eulerian digraphs, Hamiltonian and semi-Hamiltonian tournaments and Moon's Theorem.
10. Breadth-first-search and depth-first-search algorithms in graphs, finding cut-vertices and blocks.
| Delivery type | Number | Length hours | Student hours |
|---|---|---|---|
| Lecture | 33 | 1 | 33 |
| Private study hours | 117 | ||
| Total Contact hours | 33 | ||
| Total hours (100hr per 10 credits) | 150 | ||
There will be two weekly office hours for students to get additional help, depending on their needs.
Regular problem solving assignments
| Exam type | Exam duration | % of formal assessment |
|---|---|---|
| Standard exam (closed essays, MCQs etc) | 2.0 Hrs 30 Mins | 100 |
| Total percentage (Assessment Exams) | 100 | |
Normally resits will be assessed by the same methodology as the first attempt, unless otherwise stated
The reading list is available from the Library website
Last updated: 4/29/2024
Errors, omissions, failed links etc should be notified to the Catalogue Team