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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

An Approximate Form of Sidorenko's Conjecture

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Hybrid - Maxwell Centre & on Zoom Department of Architecture, University of Cambridge Cambridge University Engineering Department, TBA

Other talks

Coming soon Discussion II continued Talk title TBC Title to be confirmed Talk title TBC Favourite Plants: the common, the captivating, and the curious
 

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