Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
This lecture presents Hong Liu's research on the multicolored Turan problem through multipartite graph sparsification techniques. Learn about a novel sparsification result for multipartite graphs that identifies bounded order subgraphs with sufficient parts and nearly identical pairwise densities within any multipartite graph having positive pairwise densities. The presentation addresses Bollobas's multicolor Turan problem as a practical application of this theoretical framework. Hong Liu, who heads the Extremal Combinatorics and Probability Group (ECOPRO) at the Institute for Basic Science (IBS), brings his expertise as a distinguished research fellow and former UK Research and Innovation Future Leaders Fellowship recipient to this complex combinatorial topic. The lecture represents joint work with Ander Lamaison and explores fundamental concepts in extremal and probabilistic combinatorics.
