510 Syllabus: Spring 2022
Math 510
Introduction to Graph Theory
Spring 2022
Syllabus and Schedule
To the main course page | homework page | dictionary page | meetings page | my home page.
The textbook is W.T. Tutte, Graph Theory.
Details will appear as time flies by.
- 1/26
Friendly introduction to graph theory.
- 1/28 – 2/11
Chapter I: Graphs and Subgraphs.
- Basics.
Read the assignment before the class so we can discuss it in class. If you don't understand some (or all) of it, that's why you read it ahead of time. Then we answer questions.
Tutte's way of writing can be opaque, so if you are confused, it's normal. That's why we talk it over (surprise?).
- 1/28: §§ 1–3 on basic concepts.
- 1/31: § 4 on attachment.
- 2/2: § 5 on detachment and connection.
- 2/7–9: § 6 on edge deletion, trees and forests, isthmi and circuits.
- 2/7: § 7 on enumerating isomorphism types of small size. (This is simple; I won't discuss it in class unless there are questions.)
- (2/9 and) 2/11: § 8 on bridges. Here we get truly serious.
- 2/11: § 9, historical notes. It's always worth reading historical notes.
- 2/14 – 3/2
Chapter II: Contractions and the Theorem of Menger.
- More basics; famous theorems.
- 2/14–16: § 1 on contraction.
- 2/16–18: § 2 on edge contraction.
- 2/21: § 3, more on attachment vertices.
- 2/23: § 4 on counting separation vertices.
- 2/25–28: § 5 on vertex and edge versions of Menger's Theorem.
- 2/28: § 6, the same for Hall's Theorem.
In the statement of II.38, read "whose U-deficiency is less than or equal to n" instead of "less than n". (Also, the proof seems to need more detail in page 52, line 3.)
- § 7, historical notes. Regarding § 7.1, Kruskal's Conjecture is now the famous Robertson–Seymour Graph Minors Theorem.
- 3/2 – 3/11
Chapter III: 2-Connection.
- Basic structure theory.
- 3/4: §§ 1-2 on 2-connected graphs.
- 3/7: § 3 on blocks in a graph.
- 3/9: § 4 on arms of a vertex. Also, digression on graph decomposition.
- 3/11: § 5 on preservation of 2-connection under deletion and contraction.
- 3/21 – 4/4
Chapter IV: 3-Connection.
- Higher structure theory.
- 3/21–23: § 1 on higher connection; § 2 on constructions and examples of 3-connected graphs.
- 3/23–28: § 3 on 3-blocks.
- 3/30: Interpolation on the induced-subgraph approach to graph theory.
- 4/1: § 4 on cleavages and the 3-block structure of a graph.
- 4/4: § 5 on edge deletion and contraction.
- 4/4: § 6 on the Wheel Theorem for 3-connected graphs.
- 4/4: § 7 for context.
- 4/6 – 4/20
Chapter VIII: Algebraic Duality.
- Algebraic approach to graph structure.
In this chapter focus on the definitions, statements, and techniques, not the proofs.
I am not following the material in the same order as the book; instead, I am emphasizing the graph and regular examples of chain groups.
Correction: The definition of a primitive chain should say the non-zero coefficients are "regular" (i.e., units, i.e., invertible).
- 4/6-8: §§ 1-3 on chain-groups and regular chain-groups. This will look a lot like linear algebra.
- 4/11-13: §§ 4-5 on cycles and coboundaries. This will look familiar to those who have studied algebraic topology.
- 4/13: § 10 on incidence matrices.
- 4/19: Snow catastrophe!
- 4/20: §§ 6-7 including duality, both algebraic and planar.
Overview of chain groups of a graph.
Planar duality is not in Ch. VIII. See the introduction to the Wikipedia article for a quick view (literally) of it.
- 4/22 – 5/6
Chapter IX: Polynomials Associated with Graphs.
- Algebra of deletion-contraction invariants. Chromatic polynomial and number.
- 4/22-27: § 2: Chromatic polynomial and chromatic number.
- 5/2: § 1: V-functions and Tutte's seminal "ring in graph theory".
- 5/4: § 4: Flow polynomial and graph duality.
- 5/6: § 6: The famous Tutte polynomial or "dichromate".
- 5/9 – 5/13
Chapter "XXX+": Matroids.
I lectured on matroids at the first formal conference on them [...] in 1964. To me that was the year of the Coming of the Matroids. Then and there the theory of matroids was proclaimed to the mathematical world. And outside the halls of lecture there arose the repeated cry: ‘What the hell is a matroid?’
— W.T. Tutte
- 5/9: Review § VIII.10 on incidence matrices. Matroids of graphs.
The short introduction by Oxley, §§ 1–2.
- 5/11: Oxley's short introduction, §§ 3–4. § 5 to see Seymour's decomposition theorem.
- 5/13: Signed graphs and their matroids. Recommended reading is my paper "SGGM", especially §§ 2(beginning), 2.1.1-2, 2.2-5, 3.1-3.
- Optional: A more detailed short introduction by Oxley.
To the main course page | homework page | dictionary page | meetings page | my home page.