A Note on Set Systems with no Union of Cardinality 0 modulo m
A Note on Set Systems with no Union of Cardinality 0 modulo m
\emphAlon, Kleitman, Lipton, Meshulam, Rabin and \emphSpencer (Graphs. Combin. 7 (1991), no. 2, 97-99) proved, that for any hypergraph \textbf\textitF=\F_1,F_2,\ldots, F_d(q-1)+1\, where q is a prime-power, and d denotes the maximal degree of the hypergraph, there exists an \textbf\textitF_0⊂ \textbf\textitF, such that |\bigcup_F∈\textbf\textitF_0F| ≡ 0 (q). We give a direct, …