{
  "id": "0906.1689",
  "version": "v4",
  "published": "2009-06-09T15:26:13.000Z",
  "updated": "2012-02-29T09:41:55.000Z",
  "title": "Monotone paths in random hypergraphs",
  "authors": [
    "Pietro Majer",
    "Matteo Novaga"
  ],
  "comment": "16 pages",
  "categories": [
    "math.PR",
    "math.CO"
  ],
  "abstract": "We determine the probability thresholds for the existence of monotone paths, of ?finite and infi?nite length, in random oriented graphs with vertex set $\\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\\mathbb N$. These graphs appear as line graph of uniform hypergraphs with vertex set $\\mathbb N$.",
  "revisions": [
    {
      "version": "v4",
      "updated": "2012-02-29T09:41:55.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "monotone paths",
      "random hypergraphs",
      "vertex set",
      "graphs appear",
      "uniform hypergraphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0906.1689M"
    }
  }
}