Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 20, 2019 | Submitted
Report Open

Sidorenko's conjecture for a class of graphs: an exposition


A famous conjecture of Sidorenko and Erdő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.

Attached Files

Submitted - 1209.0184.pdf


Files (79.2 kB)
Name Size Download all
79.2 kB Preview Download

Additional details

August 19, 2023
October 18, 2023