David Conlon, Jacob Fox, Benny Sudakov
Published 2012-09-02Version 1
A famous conjecture of Sidorenko and Erd\H{o}s-Simonovits 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. The goal of this expository note is to give a short self-contained proof (suitable for teaching in class) of the conjecture if H has a vertex complete to all vertices in the other part.
Comments: 3 pages, unpublished note
An approximate version of Sidorenko's conjecture
A Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
![QR code for arXiv:1209.0184 [math.CO]](http://oss.arxitics.com/images/favicon.svg)