Abstract
Answering in a strong form a question posed by Bollobás and Scott, in this paper we determine the discrepancy between two random k-uniform hypergraphs, up to a constant factor depending solely on k.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 147-162 |
| Number of pages | 16 |
| Journal | Random Structures and Algorithms |
| Volume | 47 |
| Issue number | 1 |
| DOIs | |
| State | Published - Aug 1 2015 |
Bibliographical note
Publisher Copyright:© 2013 Wiley Periodicals, Inc.
Keywords
- Discrepancy
- Random graphs and hypergraphs
- Similarity of graphs