Discrepancy of random graphs and hypergraphs
Combinatorics
2013-02-15 v1
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.
Cite
@article{arxiv.1302.3507,
title = {Discrepancy of random graphs and hypergraphs},
author = {Jie Ma and Humberto Naves and Benny Sudakov},
journal= {arXiv preprint arXiv:1302.3507},
year = {2013}
}
Comments
12 pages, 1 figure