{
  "id": "1312.1205",
  "version": "v2",
  "published": "2013-12-04T15:24:07.000Z",
  "updated": "2014-10-21T21:53:24.000Z",
  "title": "A Note on the Inducibility of 4-vertex Graphs",
  "authors": [
    "Chaim Even-Zohar",
    "Nati Linial"
  ],
  "comment": "2 tables",
  "journal": "Graphs and Combinatorics, 2014",
  "doi": "10.1007/s00373-014-1475-4",
  "categories": [
    "math.CO"
  ],
  "abstract": "There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph H is its extremal density, as an induced subgraph of G, where |G| -> infinity. Already for 4-vertex graphs many questions are still open. Thus, the inducibility of the 4-path was addressed in a construction of Exoo (1986), but remains unknown. Refuting a conjecture of Erdos, Thomason (1997) constructed graphs with a small density of both 4-cliques and 4-anticliques. In this note, we merge these two approaches and construct better graphs for both problems.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-12-04T15:24:07.000Z",
      "journal": null,
      "doi": null
    },
    {
      "version": "v2",
      "updated": "2014-10-21T21:53:24.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "inducibility",
      "construct better graphs",
      "large graph",
      "constant size graphs",
      "extremal density"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1312.1205E"
    }
  }
}