{
  "id": "math/0410218",
  "version": "v1",
  "published": "2004-10-08T00:39:44.000Z",
  "updated": "2004-10-08T00:39:44.000Z",
  "title": "The sum of degrees in cliques",
  "authors": [
    "B. Bollobas",
    "V. Nikiforov"
  ],
  "comment": "10 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We investigate lower bounds on the average degree in r-cliques in graphs of order n and size greater than t(r,n), where t(r,n) is the size of the Turan graph on n vertices and r color classes. Continuing earlier research of Edwards and Faudree, we completely prove a conjecture of Bollobas and Erdoes from 1975.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-10-08T00:39:44.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C35"
    ],
    "keywords": [
      "lower bounds",
      "continuing earlier research",
      "color classes",
      "average degree",
      "turan graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math.....10218B"
    }
  }
}