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).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 97-99 |
| Number of pages | 3 |
| Journal | Graphs and Combinatorics |
| Volume | 7 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 1991 |
Fingerprint
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Mathematics(all)
Cite this
Set systems with no union of cardinality 0 modulo m. / Alon, N.; Kleitman, D.; Lipton, R.; Meshulam, R.; Rabin, M.; Spencer, J.
In: Graphs and Combinatorics, Vol. 7, No. 2, 06.1991, p. 97-99.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Set systems with no union of cardinality 0 modulo m
AU - Alon, N.
AU - Kleitman, D.
AU - Lipton, R.
AU - Meshulam, R.
AU - Rabin, M.
AU - Spencer, J.
PY - 1991/6
Y1 - 1991/6
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=0010719588&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0010719588&partnerID=8YFLogxK
U2 - 10.1007/BF01788135
DO - 10.1007/BF01788135
M3 - Article
AN - SCOPUS:0010719588
VL - 7
SP - 97
EP - 99
JO - Graphs and Combinatorics
JF - Graphs and Combinatorics
SN - 0911-0119
IS - 2
ER -