{
  "id": "1110.1249",
  "version": "v1",
  "published": "2011-10-06T12:52:40.000Z",
  "updated": "2011-10-06T12:52:40.000Z",
  "title": "On $r$-colorability of random hypergraphs",
  "authors": [
    "Andrei Kupavskii",
    "Dmitry Shabanov"
  ],
  "comment": "32 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "The work deals with the threshold probablity for r-colorability in the binomial model H(n,k,p) of a random k-uniform hypergraph. We prove a lower bound for this threshold which improves the previously known results in the wide range of the parameters r=r(n) and k=k(n).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-10-06T12:52:40.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C80"
    ],
    "keywords": [
      "random hypergraphs",
      "random k-uniform hypergraph",
      "lower bound",
      "threshold probablity",
      "wide range"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 32,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1110.1249K"
    }
  }
}