Set systems with no union of cardinality 0 modulo m

N. Alon; D. Kleitman; R. Lipton; R. Meshulam; M. Rabin; J. Spencer

doi:10.1007/BF01788135

Set systems with no union of cardinality 0 modulo m

N. Alon, D. Kleitman, R. Lipton, R. Meshulam, M. Rabin, J. Spencer

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

Let q be a prime power. It is shown that for any hypergraph ℱ = {F₁,..., F_d(q-1)+1} whose maximal degree is d, there exists Ø ≠ ℱ₀ ⊂ ℱ, 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	https://doi.org/10.1007/BF01788135
State	Published - Jun 1991
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/BF01788135

Cite this

@article{bb515bdbf3a9476ea57baf41f883de01,

title = "Set systems with no union of cardinality 0 modulo m",

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 {\O} ≠ ℱ0 ⊂ ℱ, such that[Figure not available: see fulltext.] ≡ 0 (mod q).",

author = "N. Alon and D. Kleitman and R. Lipton and R. Meshulam and M. Rabin and J. Spencer",

year = "1991",

month = jun,

doi = "10.1007/BF01788135",

language = "English (US)",

volume = "7",

pages = "97--99",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "2",

}

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

SN - 0911-0119

VL - 7

SP - 97

EP - 99

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 2

ER -

Set systems with no union of cardinality 0 modulo m

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this