Material

Lecture 2: DP algorithms for tree-decompositions

Lecture: video, slides.

Tutorial: tutorial sheet, solutions.

Lecture 3: Brambles, treewidth duality theorem

Lecture: video, slides.

Tutorial: tutorial sheet, solutions.

Lecture 4: Planar graphs and coloring

Lecture: video, slides.

Tutorial: tutorial sheet, solutions.

Lecture 5: Discharging and potential method

Lecture: video 1, video 2, slides.

Tutorial: tutorial sheet, solutions.

Lecture 6: Treewidth of planar graphs and applications, bidimensionality

Lecture: video, slides.

Tutorial: tutorial sheet, solutions.

Lecture 7: Minors, Kuratowski/ Wagner + product structure theorem

Lecture: video, slides.

Tutorial: tutorial sheet, solutions.

Lecture 8: Shallow minors and classes of bounded expansion

Lecture: video, slides.

Tutorial: tutorial sheet, solutions.

Lecture 9: Generalized Coloring Numbers

Lecture: video, slides.

Tutorial: tutorial sheet, solutions.

Lecture 10: Neighbourhood and profile complexity, metric dimension, VC-dimension

Lecture: video, slides.

Tutorial: tutorial sheet, solutions.

Lecture 11: Applications of generalized colorings and neighborhood complexity

Lecture: video, slides.

Slides by Dr. Shivesh K Roy: Sunflowers Meet Sparsity: A Kernel for Weighted Clique-Packing on Sparse Graphs

Lecture 12: Approximation for distance-d independent set and dominating set, opening to other topics, conclusion 

Lecture: video, slides.

Question paper: Click here

Solutions: Click here