Graph Theory
AY2019/2020 Semester 1
This course provides an introduction to working with the most accessible discrete structures, i.e., graphs. * Review of introductory graph theory from MAS214. * Connectivity and matchings, Hall's theorem, Menger's theorem, Network flows * Paths and cycles, complete subgraphs and Turan's theorem, Erdos-Stone theorem * Graph colouring, four-colour theorem * Ramsey theory * Probabilistic methods in graph theory * Use of software to solve graph-theoretic problems
| AUs | 4.0 AUs |
| Categories | CoreMinorsBDE |
| Not Available To Programme | PHY-2ndMaj/Spec(PMAS) |
| Exam |
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |