Conference paper
Fault tolerant graphs, perfect hash functions and disjoint paths
Miklos Ajtai, N. Alon, et al.
FOCS 1992
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.
Miklos Ajtai, N. Alon, et al.
FOCS 1992
R.J. Lipton, R.E. Miller, et al.
FOCS 1975
N. Alon, E.E. Bergmann, et al.
IEEE Trans. Inf. Theory
R.J. Lipton, R.E. Miller, et al.
Journal of Computer and System Sciences