An Approximate Form of Sidorenko's Conjecture

Add to your list(s) Download to your calendar using vCal

• David Conlon (St John's College, Cambridge)
• Thursday 03 February 2011, 15:00-16:00
• MR12.

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:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.