Quasi‐random classes of hypergraphs

We investigate the relations among a number of different graph properties for k‐uniformhypergraphs, which are shared by random hypergraphs. Various graph properties form equivalence classes which in turn constitute a natural hierarchy. The analogues for binary functions on k‐tuples and for hypergraphs with small density are also considered. Several classes are related to communication complexity and expander graphs.