| Home | Syllabus | Schedule | Materials | Problem sets |
|---|
Instructor: Péter Csikvári |
Office: Room 3.616 |
|---|---|
Email: peter.csikvari [at] gmail.com |
Lectures: |
Office Hours: Th 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/25/2022, 03/18/2022, 04/8/2022, 04/29/2022 and 05/13/2022. All dates are Fridays.