An introduction to some of the key parts of graph theory: connectivity, planarity and matchings. Connectivity: Menger’s Theorem, 3-connected graphs and contractible edges, Kuratowski’s Theorem, uniqueness of planar embeddings. Planarity, cycle and co-cycle spaces: peripheral cycles and the cycle space of a 3-connected graph. Matchings: Review of Konig’s Theorem, Tutte’s Theorem. [Offered: F,S] Prereq: MATH 239 or 249; Not open to General Mathematics students
