On the Number of Independent Sets in Simple Hypergraphs.

Extremal problems on the number of <italic>j</italic>-independent sets in uniform simple hypergraphs are studied. Nearly optimal results on the maximum number of independent sets for the class of simple regular hypergraphs and on the minimum number of independent sets for the class of simple hypergraphs with given average degree of vertices are obtained. [ABSTRACT FROM AUTHOR]