Discrepancy of random graphs and hypergraphs

Jie Ma, Humberto Naves, Benny Sudakov

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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 languageEnglish (US)
Pages (from-to)147-162
Number of pages16
JournalRandom Structures and Algorithms
Issue number1
StatePublished - Aug 1 2015

Bibliographical note

Publisher Copyright:
© 2013 Wiley Periodicals, Inc.


  • Discrepancy
  • Random graphs and hypergraphs
  • Similarity of graphs


Dive into the research topics of 'Discrepancy of random graphs and hypergraphs'. Together they form a unique fingerprint.

Cite this