Graph Theory, SF2740 / Kombinatorik III, MM8011
Tentative Lecture Plan
Course homepage: http://www.math.kth.se/math/GRU/20013.2014/SF2740/
|
|
Graph Theory, SF2740 / Kombinatorik III, MM8011Tentative Lecture PlanCourse homepage: http://www.math.kth.se/math/GRU/20013.2014/SF2740/ |
|
|
Except Oct 24 is moved to Monday Oct 28, 10.15-12.00 |
||||||
| Nr | Date | Room | Chapter in Diestel | Topic | Suggested exercises (Numbering as in the pdf-version of the book) |
|
| 1 | 5/9 | 306 | 1.1-1.3 | Introduction | 1:1-8 | |
| 2 | 12/9 | 32 | 1.3-1.5,1.8 | Basics | 1:11,12,13,17,22,23(i),30 | |
| 3 | 19/9 | 32 | 1.6, 2.1 | Bipartite graphs | 1:26,27; 2:1,4,10,12 | |
| 4 | 26/9 | 32 | 2.2,2.5 + extra | Matchings, Gallai-Edmonds structre thm, Gallai-Milgram | 2:14,16,18,19,20,29 | 1st set of hand-in-problems distributed |
| 5 | 3/10 | 32 | 3.1,3.2 | Connectivity | 3:1,2,6,7,9 | |
| 6 | 10/10 | 32 | 3.3,3.4 | Menger and Mader thms | 3:10,15,18,19,24 | 1st set of hand-in-problems due |
| 7 | 17/10 | 32 | 1.7,4.1-4.2 | Minors | 1:29; 4:1,2,3,4,6 | |
| 8 | 28/10 | 306 | 4.2,4.4,7.3 | Planar graphs, Hadwiger's conj. | 4:15,17,18,20; 7:26,28,30 |
|
| 9 | 31/10 | 5.1-5.2 | Coloring vertices | 5:3,6,7,12,16,18 | ||
| 10 | 7/11 | 5.3-5.4 | Coloring edges and list coloring | 5:21,25,29,31,33 | ||
| 11 | 14/11 | 5.5 | Perfect graphs | 5:37, 39, 40, 42, 43 |
||
| 12 | 21/11 | 11.1-11.2 | Random graphs | 11:1,2,3,4 | ||
| 13 | 28/11 | 11.2-11.3 | Probabilistic method, almost all graphs | 6,7,8,10,11,12 | ||
| 14 | 5/12 | 7.1,7.4,7.5 | Extremal graph theory, the regularity lemma | |||
| 15 | 12/12 | TBA | ||||