18.217 | Fall 2019 | Graduate

Graph Theory and Additive Combinatorics

Video Lectures

Lecture 4: Forbidding a Subgraph III: Algebraic Constructions

Description: How does one construct graphs that do not contain complete bipartite subgraphs of a given size? Professor Zhao explains algebraic constructions known as norm graphs and more recent constructions based on the use of random polynomials.

Instructor: Yufei Zhao

Course Info

Instructor
Departments
As Taught In
Fall 2019
Level
Graduate
Topics
Learning Resource Types
Lecture Videos
Problem Sets
Lecture Notes
Instructor Insights
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2024 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2024 Massachusetts Institute of Technology