GIVE NOW about ocw help & faqs contact us
18.217 | Fall 2019 | Graduate

# Graph Theory and Additive Combinatorics

Description: After proving Roth’s theorem last lecture, Professor Zhao explains Behrend’s construction of large sets of integers without 3-term arithmetic progressions, as well as another application of the triangle removal lemma to subsets of a 2-dimensional lattice without corners.

The second half of the lecture discusses further applications of the regularity method within graph theory: graph embedding, counting, and removal lemmas, as well as a proof of the Erdős–Stone–Simonovits theorem on H-free graphs.

Instructor: Yufei Zhao

Viewing videos requires an internet connection

## Course Info

##### Instructor

- Prof. Yufei Zhao

##### Departments

- Mathematics

##### As Taught In

Fall 2019

##### Level

Graduate

##### Topics

- Mathematics
  - Applied Mathematics
  - Discrete Mathematics
  - Probability and Statistics

##### Learning Resource Types

theaters Lecture Videos
assignment Problem Sets
notes Lecture Notes
co_present Instructor Insights

Browse Resources

# You are leaving MIT OpenCourseWare

Please be advised that external sites may have terms and conditions, including license rights, that differ from ours. MIT OCW is not responsible for any content on third party sites, nor does a link suggest an endorsement of those sites and/or their content.