R.J. Lipton, R.E. Miller, et al.
Journal of Computer and System Sciences
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.
R.J. Lipton, R.E. Miller, et al.
Journal of Computer and System Sciences
Miklos Ajtai, N. Alon, et al.
FOCS 1992
N. Alon, Paul Seymour, et al.
STOC 1990
N. Alon, Moni Naor
IEEE Transactions on Industry Applications