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