Time and location:
To pass tutorials: get at least 50% of the points (stars) for the homework assignments.
Date | Topic | Study materials |
---|---|---|
October 7 | Classes characterized by forbidden subgraphs and induced subgraphs. | lecture notes + homework |
October 14 | Cographs. Chordal graphs and tree decompositions. | lecture notes + homework |
October 21 | Tree-width and minors. | lecture notes + homework |
October 29 | Algorithms for graphs with bounded tree-width | lecture notes + homework |
November 4 | MSOL, Ehrenfeucht-Fraisse game | lecture notes + homework |
November 11 | Minors and topological minors in dense graphs. | lecture notes + homework |
November 18 | Connectivity and linkedness | lecture notes + homework |
December 9 | Graph choosability and combinatorial nullstellensatz | lecture notes + homework |
December 10 | Epsilon-regular pairs, formulation of Regularity lemma. | lecture notes + homework |
December 16 | Applications of Regularity lemma (Removal lemma, Erdos-Stone theorem) | lecture notes |
January 6 | Hales-Jewett, Gallai-Witt, van den Waerden, Roth | lecture notes |