University of Cambridge > Talks.cam > Combinatorics Seminar > An Approximate Form of Sidorenko's Conjecture

An Approximate Form of Sidorenko's Conjecture

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

  • UserDavid Conlon (St John's College, Cambridge)
  • ClockThursday 03 February 2011, 15:00-16:00
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity