a note on set systems with no union of cardinality 0 modulo m
Clicks: 15
ID: 240375
2003
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
4.2
/100
15 views
4 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #19 of 23 articles by views in Proteins
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Alon, Kleitman, Lipton, Meshulam, Rabin and Spencer (Graphs. Combin. 7 (1991), no. 2, 97-99) proved, that for any hypergraph F ={F 1,F 2,…, F d(q-1)+1 }, where q is a prime-power, and d denotes the maximal degree of the hypergraph, there exists an F 0 ⊂ F, such that |⋃ F∈ F 0 F| ≡ 0 (q). We give a direct, alternative proof for this theorem, and we also show that an explicit construction exists for a hypergraph of degree d and size Ω(d 2) which does not contain a non-empty sub-hypergraph with a union of size 0 modulo 6, consequently, the theorem does not generalize for non-prime-power moduli.
| Reference Key |
grolmusz2003discretea
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Vince Grolmusz |
| Journal | Proteins |
| Year | 2003 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.