Counting in Sparse Graphs

Selected Topics in Graph Theory

Home Syllabus Schedule Materials Problem sets

Instructor: Péter Csikvári

Office: Room 3.616

Email: peter.csikvari [at]

Lectures: T 13:00-14:00

Office Hours: T 13:00-14:00


In this course we study approximation problems for counting objects in graphs. The information that we might get may be the whole graph, or just the degree sequence, or some statistics about the local structure of the graph.

Prerequisites: Linear algebra, basic probability theory and graph theory.


The problem sets are due on the following dates: 02/26/2021, 03/12/2021, 04/02/2021, 04/23/2021 and 05/14/2021. All dates are Fridays.