Discrepancy of random graphs and hypergraphs |
| |
| Authors: | Jie Ma Humberto Naves Benny Sudakov |
| |
| Affiliation: | 1. Department of Mathematics, UCLA, Los Angeles, California;2. Department of Mathematics, ETH, 8092 Zurich, Switzerland |
| |
| 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. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 47, 147–162, 2015 |
| |
| Keywords: | Discrepancy random graphs and hypergraphs similarity of graphs |
|
|
