COMBINATORIAL GEOMETRY

Credits: 
3.0
Course Description: 

Convexity, separation, Helly, Radon, Ham-sandwich theorems, Erdős-Szekeres theorem and its relatives, incidence problems, the crossing number of graphs, intersection patterns of convex sets, Caratheodory and Tverberg theorems, order types, Same Type Lemma, the k-set problem

Learning Outcomes: 

By the end of the course, students are enabled to do independent study and research in fields touching on the topics of the course, and how to use these methods to solve specific problems. In addition, they develop some special expertise in the topics covered, which they can use efficiently in other mathematical fields, and in applications, as well. They also learn how the topic of the course is interconnected to various other fields in mathematics, and in science, in general.

File Attachments: