Special Colloquium
Choongbum Lee
Massachusetts Institute of Technology
Some advances in Sidorenko's conjecture
Abstract: An important conjecture of Erdös-Simonovits and Sidorenko states that if $H$ is a fixed bipartite graph, then the random $n$-vertex graph ($n$ is large) has asymptotically the minimum number of copies of $H$ over all graphs of the same order and edge density. This conjecture also has an equivalent analytic form and has connections to a broad range of topics such as matrix theory, Markov chains, graph limits, and quasirandomness. In this talk, I will provide an overview on this beautiful conjecture and discuss some recent results.
Joint w/ Jeong Han Kim (KIAS) and Joonkyung Lee (Oxford)
Meet and Greet in SEO 300 right after the talk.
Wednesday December 10, 2014 at 3:00 PM in SEO 636