Quasirandomness in hypergraphs.

A graph G is called quasirandom if it possesses typical properties of the corresponding random graph G(n,p) with the same edge density as G. A well-known theorem of Chung, Graham and Wilson states that, in fact, many such ‘typical’ properties are asymptotically equivalent and, thus, a graph G possessing one property immediately satisfies the others.