{
  "id": "math/0405080",
  "version": "v1",
  "published": "2004-05-05T16:19:39.000Z",
  "updated": "2004-05-05T16:19:39.000Z",
  "title": "Books in graphs",
  "authors": [
    "Bela Bollobas",
    "Vladimir Nikiforov"
  ],
  "comment": "13 pages, accepted in Eur. J. Combin",
  "categories": [
    "math.CO"
  ],
  "abstract": "A book of size $q$ is a set of $q$ triangles sharing a common edge. We study the size of the maximal book in a graph as a function of the number of its edges. In particular, we answer two questions of Erdos about graphs that are union of triangles.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-05-05T16:19:39.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C35"
    ],
    "keywords": [
      "maximal book",
      "common edge"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math......5080B"
    }
  }
}