Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists
An intersection theorem for supermatroids
✍ Scribed by Éva Tardos
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 567 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let E~:={x = (x 1 ..... x,): x~{0
Let N (n, k) be the set of all n-tuples over the alphabet {0, 1, . . . , k} whose component sum equals . A subset F ⊆ N (n, k) is called a t-intersecting family if every two tuples in F have nonzero entries in at least t common coordinates. We determine the maximum size of a t-intersecting family in
A new intersection theorem for multivalued maps is obtained. This new theorem requires the maps involved to satisfy a weaker compactness condition and generalizes known results. Applications of this new theorem are given to the existence of maximal and greatest elements for strict and weak relations