|
Topic |
Date |
Slides / Handout |
00 |
Friendship theorem |
5 Apr 2019 |
[Slides 00] /
[Handout 00]
|
01 |
Matchings |
8 Apr 2019 |
[Slides 01] /
[Handout 01]
|
02 |
Turan's theorem |
15 Apr 2019 |
[Slides 02] /
[Handout 02]
|
03 |
Spanning trees |
26 Apr 2019 |
[Slides 03] /
[Handout 03]
|
04 |
Hamilton cycles |
29 Apr 2019 |
[Slides 04] /
[Handout 04]
|
05 |
Degree sequences |
6 May 2019 |
[Slides 05] /
[Handout 05]
|
06 |
Girth |
10 May 2019 |
[Slides 06] /
[Handout 06]
|
07 |
Connectivity |
13 May 2019 |
[Slides 07] /
[Handout 07]
|
08 |
Planarity |
17 May 2019 |
[Slides 08] /
[Handout 08]
|
09 |
Crossings |
24 May 2019 |
[Slides 09] /
[Handout 09]
|
10 |
Bandwidth |
31 May 2019 |
[Slides 10] /
[Handout 10]
|
11 |
Colorings |
7 Jun 2019 |
[Slides 11] /
[Handout 11]
|
12 |
Ramsey theory |
28 Jun 2019 |
[Slides 12] /
[Handout 12]
|
12 |
Final remarks |
28 Jun 2019 |
[Slides 13] /
[Handout 13]
|