{
  "id": "math/0310485",
  "version": "v2",
  "published": "2003-10-31T12:18:39.000Z",
  "updated": "2003-11-25T17:57:30.000Z",
  "title": "The upper bound on number of graphs, with fixed number of vertices, that vertices can be colored with n colors",
  "authors": [
    "Kamil Kulesza",
    "Zbigniew Kotulski"
  ],
  "comment": "7 pages, submitted for journal publication",
  "categories": [
    "math.CO"
  ],
  "abstract": "In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while the exponent is the difference between |V| and n. We also state three conjectures on the number of graphs that have fixed number of vertices |V| and chromatic number n.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2003-11-25T17:57:30.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C30"
    ],
    "keywords": [
      "fixed number",
      "upper bound",
      "chromatic number",
      "bound relates",
      "difference"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2003math.....10485K"
    }
  }
}