General Info

Overview

In this class, we will cover fundamental topics in graph theory, such as coloring, planarity, connectivity, matchings, and extremal graph theory. Some areas we may also cover include matroid theory and embeddings of graphs on higher-genus surfaces.COMS W3203 (Discrete Mathematics) is listed as the formal prerequisite, though no prior knowledge of graphs is assumed. An introductory algorithms class (e.g. CSOR W4231) also covers some graph theory, but this course will overlap as little as possible. This class will not have any programming component.

The textbook for this class is Diestel, Graph Theory, 5th Edition, and any supplemental reading will be posted on CourseWorks.

The breakdown of the grading is 30% homework, 30% in-class midterm, 40% final.

Schedule

Click here for a list of lectures and relevant readings. The midterm will be in class on Homework

Academic Honesty

This class adheres to the Computer Science department policy on academic honesty. You may discuss homework problems with other students, but you must write up your own solutions and acknowledge anyone you worked with. Consulting solutions from the Internet is prohibited and is considered a violation of the honor code.