{
  "id": "1302.3507",
  "version": "v1",
  "published": "2013-02-14T18:56:40.000Z",
  "updated": "2013-02-14T18:56:40.000Z",
  "title": "Discrepancy of random graphs and hypergraphs",
  "authors": [
    "Jie Ma",
    "Humberto Naves",
    "Benny Sudakov"
  ],
  "comment": "12 pages, 1 figure",
  "categories": [
    "math.CO"
  ],
  "abstract": "Answering in a strong form a question posed by Bollob\\'as and Scott, in this paper we determine the discrepancy between two random k-uniform hypergraphs, up to a constant factor depending solely on k.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-02-14T18:56:40.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "random graphs",
      "discrepancy",
      "random k-uniform hypergraphs",
      "strong form",
      "constant factor depending"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1302.3507M"
    }
  }
}