On testing the `pseudo-randomness' of a hypergraph (Q1195483)

From authors' abstract: In 1989, by the authors a definition for a pseudo-random hypergraph was proposed. Moreover, a sufficient condition was given for a hypergraph to be pseudo-random according to this definition. Here we show that a weaker condition suffices, and give a short proof. We also report a number of examples which show that the resemblance of pseudo-random hypergraphs to random hypergraphs is much less marked than the analogous comparison in the case of graphs. The examples are easily verified by means of the theorem presented here.