This graduate introduction bridges graph theory and additive combinatorics, highlighting the interplay of structured deterministic objects and pseudorandom objects. It develops powerful techniques across discrete math, with clear proofs and many exercises from an MIT course.

Key Topics

• Turán-type extremal
• Regularity Method
• Pseudorandom graphs
• Graph limits
• Sum-product problem

Author: Yufei Zhao