{
  "id": "math/0501211",
  "version": "v1",
  "published": "2005-01-14T01:31:54.000Z",
  "updated": "2005-01-14T01:31:54.000Z",
  "title": "The minimum number of 4-cliques in graphs with triangle-free complement",
  "authors": [
    "Vladimir Nikiforov"
  ],
  "comment": "8 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Write f(n) for the minimum number of 4-cliques in graphs of order n with triangle-free complement. Finding f(n) is a particular case of a problem raised by Erdos in 1962. We give an upper bound of f(n) and a matching lower bound when the graph is close to regular.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2005-01-14T01:31:54.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C35"
    ],
    "keywords": [
      "minimum number",
      "triangle-free complement",
      "upper bound",
      "matching lower bound"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2005math......1211N"
    }
  }
}