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

Transcript

Course Info

Learning Resource Types

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