Among topics that will be covered in the class are the following: graphs and subgraphs, trees, connectivity, Euler tours, Hamilton cycles, matchings, Hall's theorem and Tutte's theorem, edge coloring and Vizing's Theorem, independent sets, Turán's theorem and Ramsey's theorem, vertex coloring, planar graphs, directed graphs, probabilistic methods and linear algebra tools in graph theory.

Prerequisite courses: Discrete mathematics or Introduction to combinatorics and graph theory, Linear algebra, and Introduction to probability.

Homework exercises will be given during the course and will account for 10% of the final grade. There will also be a final exam.

The course will be taught in English.