{
  "id": "1610.06058",
  "version": "v1",
  "published": "2016-10-19T15:22:40.000Z",
  "updated": "2016-10-19T15:22:40.000Z",
  "title": "Coverings, Matchings and the number of maximal independent sets of graphs",
  "authors": [
    "Do Trong Hoang",
    "Tran Nam Trung"
  ],
  "comment": "7 pages, 1 figure",
  "categories": [
    "math.CO"
  ],
  "abstract": "We determine the maximum number of maximal independent sets of arbitrary graphs in terms of their covering numbers and we completely characterize the extremal graphs. As an application, we give a similar result for K\\\"onig-Egerv\\'ary graphs in terms of their matching numbers.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-10-19T15:22:40.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "maximal independent sets",
      "maximum number",
      "extremal graphs",
      "arbitrary graphs",
      "similar result"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}