N. Alon, E.E. Bergmann, et al.
IEEE Trans. Inf. Theory
Paper
Set systems with no union of cardinality 0 modulo m
Abstract
Let q be a prime power. It is shown that for any hypergraph ℱ = {F1,..., Fd(q-1)+1} whose maximal degree is d, there exists Ø ≠ ℱ0 ⊂ ℱ, such that[Figure not available: see fulltext.] ≡ 0 (mod q). © 1991 Springer-Verlag.
Related
N. Alon, Moni Naor
IEEE Transactions on Industry Applications
R.J. Lipton, R.E. Miller, et al.
Journal of Computer and System Sciences
R.J. Lipton, R.E. Miller, et al.
FOCS 1975