Math 412
Introduction to Graph Theory
Sections C13 and C14
Instructor: Alexandr Kostochka
Office: 255 Computer Application Building
Phone: (217) 265-8037 (office)
Fax: (217) 333-9576
E-mail:
kostochk@illinois.edu
Time and place: 10 - 10:50 am MWF, 1027 Lincoln Hall.
Final exam:
1:30-4:30 p.m., Friday, May 10.
Office hours: Temporarily, 2-3 pm MF and by
appointment.
Class Announcements
We will have the Make-Up Quiz on Friday, April 26 in class. The topics covered by the
Quiz are:
1. Matchings and covers. Konig-Egervary Theorem. Gallai's Theorem.
2. Matchings in general graphs. Tutte's Theorem, Berge-Tutte Formula.
3. Planar and plane graphs. Euler's Formula and its corollaries.
4. Outerplanar graphs, maximal planar graphs.
5. Kuratowski's Theorem and Wagner's Theorem.
6. Colorings. Greedy algorithm for coloring. A bad example for a tree.
7. d-Degenerate graphs and their definitions.
8. Color-critical graphs and their properties ((k-1)-edge-connected etc.).
9. Mycielski's Construction.
10. Brooks' Theorem.
11. Edge colorings, Properties of edge colorings. Petersen graph is not 3-edge-colorable.
12. Shannon's Theorem and extremal examples for it. Vizing's Theorem.
An example of a former Quiz 1 is here: [ A former Quiz 1.pdf];
The midterm tests are now planned to be evening exams in 160 English Building
at 7pm on
Wednesdays, February 28, March 27 and April 17.
An example of a former Test 1 is here: [ A former Test 1.pdf];
Help sessions are on Tuesdays from 4pm to 5:30pm in Room 150 English Building.
Last changed on April 19, 2024.