Introductory and Algebraic Graph Theory
Math 510: Spring 2018
Thomas Zaslavsky
Individual and Group Meetings; Makeup Classes
Index
Course guide | Syllabus | Assignments | Information & announcements
Oral exam on Diestel Chapter 1
Schedule
(Outdated)
Topics I may ask about
Schedule
Hour | Mon. 3/12 | Wed. 3/14 |
2:40 | Mike | Arielle |
3:00 | Marcus | Amy |
3:20 | Jon | Matt |
3:40 | Yinsong | Zach |
4:00 | | Nick |
4:20 | | Mengyu |
4:40 | | Andrew |
5:00 | | Haomiao |
Topics I may ask about
- Chapter 3
- The block-cutpoint graph.
- Menger's Theorem: proof 1 and applications (subsequent corollaries and theorem in that section).
- Chapter 4
- §4.2: Euler's formula and corollaries (with girth: Ex. 4.4).
- §4.4: Kuratowski's theorem for 3-connected graphs.
- §4.4: Planarity for graphs that are not 3-connected (you don't need to do it his way; do it my allegedly easier way).
- Chapter 5
- Chromatic number: definition and examples.
- §5.3: Konig's theorem and proof.
- §5.3: Vizing's theorem, not proof.
Schedule
Hour | Tues. 3/20 | Wed. 3/21 | Thurs. 3/22 | Fri. 3/23 |
1:00 | — | — | Mengyu | — |
2:30 | — | Matt | — | Arielle |
3:00 | — | Marcus | Haomiao | — |
3:30 | Andrew | Nick | Yinsong | Josh |
4:00 | Jon | Zach | — | — |
4:30 | — | Amy | — | — |
5:00 | — | Mike | — | — |
Schedule
Hour | Mon. 3/26 | Wed. 3/28 | Fri. 3/30 |
2:40 | Marcus | Yinsong |
3:00 | | Jon |
3:20 | | Zach |
3:40 | Mike | Matt | Arielle |
4:00 | — | Nick |
4:20 | — | Mengyu |
4:40 | — | Haomiao |
5:00 | — | Amy |
5:30 | | Josh |
6:00 | | Andrew |
Topics I may ask about
Reminder: You can choose your exam topics from my list; I'm not going to force my choice on you. (If you only picked easy topics I'll add a harder one.)
- Chapter 6
- General definition; conservation; particular types.
- Properties of circulations.
- (s,t)-flows, MFMC Theorem 6.2.2. (No proofs in this section!)
- Nowhere-zero flows:
- H-flows (H = finite abelian group).
- k-flows.
- Equivalence theorem 6.3.3 and proof.
- Flow polynomial and proof.
- Assigned homework.
- Chapter 10
- §10.1 as assigned, & Ore's Theorem (including proof).
- Assigned homework.
You should know about all the topics but you don't need to know them all in detail. For detailed knowledge study at least one from each chapter, and at least 3 altogether. If a topic has many aspects, you could prepare some of them.
Course guide | Syllabus | Assignments | Information & announcements
- Tues., March 20, for M 3/19.
- Fri., March 30, for W 2/7.
- Wed., April 18, for F 3/2.
- Wed., April 25, for F 3/16.
- Wed., May 2, for F 4/13.
Course guide | Syllabus | Assignments | Information & announcements
Course guide | Syllabus | Assignments | Information & announcements