Instructor: Timothy Sun (OH: 4-6pm F, 521 CSB)
TAs: Geelon So (OH: 5:30-7pm W, TA room)
Room: 327 Mudd
Time: TR 2:40-3:55pm
Textbook: Diestel, Graph Theory, 5th Edition. 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. Click here for a list of lectures and relevant readings. The midterm will be in class on March 8, and the final exam will be on May 10.

Homework 1, due Feb 8, 2018. [LaTeX source]

Homework 2, due Feb 22, 2018.

Homework 3, due Mar 8, 2018.

Homework 4, due Apr 3, 2018.

Homework 5, due Apr 17, 2018.

Homework 6, due Apr 26, 2018.

Homework assignments must be typed, with the exception of drawings. You will hand in a hard copy of each problem set at the beginning of that day's class. You are encouraged to typeset them using LaTeX--a template will be uploaded to CourseWorks. Barring unforseen circumstances (e.g. serious illness), late homework will be penalized 10% each day (rounding up) after the deadline, for up to 7 days. Homework submitted more than 7 days late will not be accepted. 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.