{
  "id": "1209.0184",
  "version": "v1",
  "published": "2012-09-02T15:49:32.000Z",
  "updated": "2012-09-02T15:49:32.000Z",
  "title": "Sidorenko's conjecture for a class of graphs: an exposition",
  "authors": [
    "David Conlon",
    "Jacob Fox",
    "Benny Sudakov"
  ],
  "comment": "3 pages, unpublished note",
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-09-02T15:49:32.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "sidorenkos conjecture",
      "exposition",
      "edge density",
      "expository note",
      "bipartite graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 3,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1209.0184C"
    }
  }
}