The previous lecture in this series is here. The next lecture in this series is here.
How does one construct graphs that do not contain complete bipartite subgraphs of a given size? Prof. Zhao explains algebraic constructions known as norm graphs and more recent constructions based on the use of random polynomials.
These videos are of a lecture course by Yufei Zhao at the Massachusetts Institute of Technology in 2019, and made available as part of its OpenCourseWare initiative. The website for the course may be found here.