18.319 | Fall 2005 | Graduate

Geometric Combinatorics

Course Description

This course offers an introduction to discrete and computational geometry. Emphasis is placed on teaching methods in combinatorial geometry. Many results presented are recent, and include open (as yet unsolved) problems.
Learning Resource Types
Problem Sets
(a-b) Petersen graphs.
Two drawings of the Petersen graph (a - b) and the planar graph corresponding to the second drawing (c). (Image by Jacob Fox and Csaba Toth.)