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

Transcript

Course Info

Learning Resource Types

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