![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Combinatorics Seminar > An Approximate Form of Sidorenko's Conjecture
An Approximate Form of Sidorenko's ConjectureAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Andrew Thomason. A beautiful conjecture of Erdos-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same order and edge density. Here we prove the conjecture if H has a vertex complete to the other part, and deduce an approximate version of the conjecture for all H. Furthermore, for a large class of bipartite graphs, we prove a stronger stability result which answers a question of Chung, Graham, and Wilson on quasirandomness for these graphs. Joint work with Jacob Fox and Benny Sudakov. This talk is part of the Combinatorics Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsDIAL seminars Babraham Institute Events Andrew ThomasonOther talks"Vectorbuilder: Revolutionising Vector Design & Custom Cloning" (25 min seminar) followed by "Advanced Technologies For Rapid Generation Of Custom Designed Animal Models" (25 min seminar) Downstream dispersion of bedload tracers Predictive modeling of hydrogen assisted cracking ā a Micromechanics conquest The homelands of the plague: Soviet disease ecology in Central Asia, 1920sā1950s Babraham Lecture - The Remote Control of Gene Expression CANCELLED - Mathematical methods in reacting flows: From spectral to Lyapunov analysis |