Graph Theory and Additive Combinatorics
MIT OpenCourseWare offers this advanced mathematics course, previously numbered 18.217, covering the intersection of graph theory and additive combinatorics. Lectures move through classical results and current research directions, including topics like Sidon sets, sum-product estimates, Szemeredi's theorem, and extremal graph structures, showing how techniques from each field solve problems in the other. Materials include lecture notes and problem sets drawn from research literature, and the course closes by introducing open problems still being worked on by mathematicians today. It is aimed at students who already have a solid grounding in combinatorics and want exposure to how modern researchers connect these two areas. As with other MIT OpenCourseWare offerings, all materials are free to access online under a Creative Commons license, with no certificate offered.