|
|
Graph Theory, SF2704Lecture Plan 2009Course homepage: http://www.math.kth.se/math/GRU/2009.2010/SF2704/ |
|
(except 22/9, when it is 10.15-13.00) |
||||
| Nr | Date | Chapter in Diestel | Topic | Suggested exercises (Numbering as in the pdf-version of the book) |
| 1 | 1/9 | 1.1-1.3 | Introduction | 1:1-7 |
| 2 | 8/9 | 1.3-1.5,1.8 | Basics | 1:10,11,12,16,20,26 |
| 3 | 15/9 | 1.6, 2.1 | Bipartite graphs | 2:1,5,7,8 |
| 4 | 22/9, 10-13 | 2.2,2.5 | Matchings, Gallai-Milgram | 2:10,11,15,16,17,23 Hand-in-problems |
| - | 29/9 | - | No Class | |
| 5 | 6/10 | 3.1,3.2 | Connectivity | 3:1,2,5,6,7,9 |
| 6 | 13/10 | 3.3,3.4 | Menger and Mader thms | 3:11,16,17,21 |
| 7 | 20/10 | 1.7,4.1-4.2 | Minors | 1:25; 4:1,2,3,4,5 |
| 8 | 27/10 | 4.2,4.4,7.3 | Planar graphs, Hadwiger's conj. | 4:13,15,16,18; 7:28,30,32 Hand-in-problems 2 |
| 9 | 3/11 | 5.1-5.2 | Coloring vertices | 5:3,6,7,11,15,17 |
| 10 | 10/11 | 5.3-5.4 | Coloring edges and list coloring | 5:21,24,28,30,32 |
| 11 | 17/11 | 5.5 | Perfect graphs | 5:36, 38, 39, 41, 42 Hand-in-problems 3 |
| 12 | 24/11 | 1. Page 1-13 of
Survey paper 2. Classical physics paper 3. Lecture Notes by van der Hofstad |
Large Random Networks Guest star Maria Deijfen |
8:2,4,6,8,11 in the notes by Remco van der Hofstad |
| 13 | 1/12 |
Ramseyteori (in Swedish) |
Ramsey Theory | See the Ramsey text |
| 14 | 8/12 In room E2 |
11.1-11.2 | Random graphs | 11:1,3,4 |
| 15 | 15/12 | 11.2-11.3 | Probabilistic method, almost all graphs | 6,7,8,10,11 |