{
  "id": "1805.01924",
  "version": "v1",
  "published": "2018-05-04T19:55:39.000Z",
  "updated": "2018-05-04T19:55:39.000Z",
  "title": "A note on $b$-coloring of Kneser graphs",
  "authors": [
    "Saeed Shaebani"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "In this short note, the purpose is to provide an upper bound for the $b$-chromatic number of Kneser graphs. Our bound improves the upper bound that was presented by Balakrishnan and Kavaskar in [$b$-coloring of Kneser graphs, Discrete Appl. Math. 160 (2012), 9-14].",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-05-04T19:55:39.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "kneser graphs",
      "upper bound",
      "short note",
      "chromatic number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}