18.217 | Fall 2019 | Graduate

Graph Theory and Additive Combinatorics

Video Lectures

Lecture 2: Forbidding a Subgraph I: Mantel’s Theorem and Turán’s Theorem

Description: Which triangle-free graph has the maximum number of edges given the number of vertices? Professor Zhao shows the class Mantel’s theorem, which says that the answer is a complete bipartite graph. He also discusses generalizations: Turán’s theorem (for cliques) and the Erdős–Stone–Simonovits theorem (for general subgraphs).

Instructor: Yufei Zhao

Course Info

As Taught In
Fall 2019
Learning Resource Types
Lecture Videos
Problem Sets
Lecture Notes
Instructor Insights