Lecture 4: Forbidding a Subgraph III: Algebraic Constructions

Name: Lecture 4: Forbidding a Subgraph III: Algebraic Constructions
Uploaded: 2020-05-12T18:00:30Z
Duration: 1 h 19 min 45 s
Description: 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: Prof. Yufei Zhao

1:19:45

Up Next

Lecture 5: Forbidding a Subgraph IV: Dependent Random Choice

Continue

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: Prof. Yufei Zhao