On sets of almost disjoint subsets of a set
✍ Scribed by P. Erdős; A. Hajnal; E. C. Milner
- Publisher
- Akadmiai Kiad
- Year
- 1968
- Tongue
- English
- Weight
- 517 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For I G t < k CI u. let S(t, k, u) denote a Steiner system and let Pr, (u) be the set of all k-subsets of theset {i,2,..., u}. We partition PJ 13) into 55 mutually disjoint S(2.4, 13)'s (projective planes). This is the first known example of a complete partition of Pk(u) into disjoint S(t, k, u)'s f
Let G be a finite group of order v. A k-element subset D of G is called a (v, k, I, p)-partial difference set in G if the expressions gh-', for g and h in D with g # h, represent each nonidentity element contained in D exactly i times and represent each nonidentity element not contained in D exactly
Lipkin, E., On subset sums of r-sets, Discrete Mathematics 114 (1993) 3677377. A finite set of distinct integers is called an r-set if it contains at least r elements not divisible by 4 for each 4 > 2. Let f(n, r) denote the maximum cardinality of an r-set A c (1,2, , n} having no subset sum Caiai