Publication
Graphs and Combinatorics
Paper

Set systems with no union of cardinality 0 modulo m

View publication

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.

Date

01 Jun 1991

Publication

Graphs and Combinatorics

Authors

Share