Instructor:  Dr. Ervin GYŐRI
Text: R. Diestel, Graph Theory (available digitally here) and handouts

Prerequisite: Some basics of discrete mathematics is needed for this course. No prior knowledge of combinatorics or graph theory is required.

Course description: Classical chapters of (extremal) graph and hypergraph theory, and on extremal problems from discrete geometry and number theory, including "cutting-edge" theorems (some of them have not appeared yet).