{
  "id": "1202.4427",
  "version": "v1",
  "published": "2012-02-20T19:20:18.000Z",
  "updated": "2012-02-20T19:20:18.000Z",
  "title": "Counting maximal antichains and independent sets",
  "authors": [
    "Liviu Ilinca",
    "Jeff Kahn"
  ],
  "comment": "12 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Answering several questions of Duffus, Frankl and R\\\"odl, we give asymptotics for the logarithms of (i) the number of maximal antichains in the n-dimensional Boolean algebra and (ii) the numbers of maximal independent sets in the covering graph of the n-dimensional hypercube and certain natural subgraphs thereof. The results in (ii) are implied by more general upper bounds on the numbers of maximal independent sets in regular and biregular graphs. We also mention some stronger possibilities involving actual rather than logarithmic asymptotics.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-02-20T19:20:18.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C69",
      "05C35",
      "06A07"
    ],
    "keywords": [
      "counting maximal antichains",
      "maximal independent sets",
      "general upper bounds",
      "n-dimensional boolean algebra",
      "natural subgraphs thereof"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1202.4427I"
    }
  }
}