{
  "id": "1602.08736",
  "version": "v1",
  "published": "2016-02-28T16:26:04.000Z",
  "updated": "2016-02-28T16:26:04.000Z",
  "title": "Uniqueness of the extremal graph in the problem of maximizing the number of independent sets in regular graphs",
  "authors": [
    "Alexei Dmitriev",
    "Alex Dainiak"
  ],
  "comment": "in Russian",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "The main purpose of this paper is to prove the uniqueness of a graph attaining the maximum of the number of independent sets over all $k$-regular graphs on $n$ vertices for $2k|n$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-02-28T16:26:04.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "regular graphs",
      "independent sets",
      "extremal graph",
      "uniqueness"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "ru",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160208736D"
    }
  }
}