{
  "id": "1111.4442",
  "version": "v1",
  "published": "2011-11-18T17:55:01.000Z",
  "updated": "2011-11-18T17:55:01.000Z",
  "title": "Inverse problems for the number of maximal independent sets",
  "authors": [
    "Alex Dainiak"
  ],
  "comment": "1 figure, 8 pages",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "We study the following inverse graph-theoretic problem: how many vertices should a graph have given that it has a specified value of some parameter. We obtain asymptotic for the minimal number of vertices of the graph with the given number $n$ of maximal independent sets for a class of natural numbers that can be represented as concatenation of periodic binary words.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-11-18T17:55:01.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C35"
    ],
    "keywords": [
      "maximal independent sets",
      "inverse problems",
      "inverse graph-theoretic problem",
      "periodic binary words",
      "natural numbers"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1111.4442D"
    }
  }
}