18.319 | Fall 2005 | Graduate

Geometric Combinatorics

Syllabus

Course Meeting Times

Lectures: 2 sessions / week, 1.5 hours / session

Prerequisite

Permission of instructor.

Assignments

A problem set will be handed out every other week. You should hand in solutions to approximately 40% of the problems, and write a paper related to any of the lectures in 18.319 by the end of the semester.

Topics Covered in this Course Include

  • Allowable Sequences
  • Incidence and Distance Problems
  • Crossing Numbers
  • Arrangements of Lines and Curves
  • Davenport-Schinzel Sequences
  • Simplicial Partitions
  • Stabbing Numbers
  • Range Spaces and VC-dimension
  • ε-nets and ε-approximations
  • Binary Space Partitions
  • Geometric Graph Theory
  • Pseudo-triangulations
  • Art Gallery Problems
  • Encompassing Graphs

Grading

ACTIVITIES PERCENTAGEs
Problem Sets 2/3
Term Paper 1/3

Course Info

Instructor
Departments
As Taught In
Fall 2005
Level