Visa version
Version skapad av Svante Linusson 2017-08-28 15:45
Visa
< föregående
Jämför
< föregående
Schedule and content
Class on Fridays 13.15 - 15.00. Exceptions
September 4 moved to Wednesday September 2, 10.15-12.00
September 25 moved to 12.15-14.00 same day.
October 2 moved to Wednesday September 30, 13.15-15.00.
Nr | Date | Chapter | Content | Recommended Exercises (Numbering as in pdf-version) |
Hand-ins |
1 | 2/9 | 1.1-1.3 | Introduction | 1:1-8 | |
2 |
11/9 |
1.3-1.5,1.8 | Basics | 1:11,12,13,17,22,23(i),30 | |
3 | 18/9 | 1.6, 2.1, | Bipartite graphs | 1:26,27; 2:1,4,10,12 + extra G-S | |
4 | 25/9 | 2.2, 2.5 + extra | Matchings, Gallai-Edmond, Gallai-Millgram | 2:14,16,18,19,20,29 | |
5 | 30/9 | 3.1-3.2 | Connectivity | 3:1,2,6,7,9 | 1 set distributed |
6 | 9/10 | 3.3-3.4 | Menger and Mader thms | 3:10,15,18,19,24 | |
7 | 16/10 | 1.7,4.1-4.2 | Minors | 1:29; 4:1,2,3,4,6 | 1st set due |
8 | 23/10 | 4.2,4.4,7.3 | Planar graphs, Hadwiger's conj. | 4:15,17,18,20;7:26,28,30 | |
9 |
30/10 | 5.1-5.2 | Coloring vertices | 5:3,6,7,12,16,18 | |
10 | 6/11 | 5.3-5.4 | Coloring edges and list coloring | 5:21,25,29,31,33 | 2nd set distributed |
11 | 13/11 | 11.1-11.2 | Random Graphs | 11.1,2,3,4 | |
12 | 20/11 | 11.2-11.3 | Probabilistic method, almost all graphs | 11:6,7,8,10,11,12 | 2nd set due |
13 | 27/11 |
11.4 + Ramsey |
Threshold functions, Ramsey theory | 11:15,16,17,18,19,21 + 7.2.2, 7.2.3 in Ramsey | |
4/12 | Student Presentations | ||||
14 | 11/12 | 7.1, pages 182-183 of 7.4 |
Turan's thm, Szemeredi's regularity lemma (statement) |
7:1,3,4,7,8,9,11,13,35,36 | |
15 | 18/12 |
1. Survey on Large Networks (pages 1-13) |
Large networks, Preferential Attachment Models |
In the lecture notes by van der Hofstad 8:2,4,6,8,12 | 3rd set distributed |
-- | 10/1 | -- | --- | --- | 3rd set due |
-- | 11/1 | --- | EXAM, time 8.00-13.00 | --- | |