{
  "id": "1109.1592",
  "version": "v2",
  "published": "2011-09-07T22:17:24.000Z",
  "updated": "2013-07-16T15:15:46.000Z",
  "title": "The Inducibility of Graphs on Four Vertices",
  "authors": [
    "James Hirst"
  ],
  "comment": "12 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We consider the problem of determining the maximum induced density of a graph H in any graph on n vertices. The limit of this density as n tends to infinity is called the inducibility of H. The exact value of this quantity is known only for a handful of small graphs and a specific set of complete multipartite graphs. Answering questions of Brown-Sidorenko and Exoo we determine the inducibility of K_{1,1,2} and the paw graph. The proof is obtained using semi-definite programming techniques based on a modern language of extremal graph theory, which we develop in full detail in an accessible setting.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2013-07-16T15:15:46.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C35"
    ],
    "keywords": [
      "inducibility",
      "complete multipartite graphs",
      "extremal graph theory",
      "exact value",
      "small graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1109.1592H"
    }
  }
}