Sidorenko's conjecture for a class of graphs: an exposition
Combinatorics
2012-09-04 v1
Abstract
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.
Cite
@article{arxiv.1209.0184,
title = {Sidorenko's conjecture for a class of graphs: an exposition},
author = {David Conlon and Jacob Fox and Benny Sudakov},
journal= {arXiv preprint arXiv:1209.0184},
year = {2012}
}
Comments
3 pages, unpublished note