𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Intersection theorems for systems of finite sets

✍ Scribed by Gy. Katona

Publisher
Akadmiai Kiad
Year
1964
Tongue
English
Weight
383 KB
Volume
15
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Complete Nontrivial-Intersection The
The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets
✍ Rudolf Ahlswede; Levon H. Khachatrian πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 728 KB

The authors have proved in a recent paper a complete intersection theorem for systems of finite sets. Now we establish such a result for nontrivial-intersection systems (in the sense of Hilton and Milner [Quart.

An intersection theorem for systems of s
An intersection theorem for systems of sets
✍ A. V. Kostochka πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 346 KB πŸ‘ 2 views

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

Intersection Statements for Systems of S
Intersection Statements for Systems of Sets
✍ W.A Deuber; P ErdΕ‘s; D.S Gunderson; A.V Kostochka; A.G Meyer πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 320 KB

A family of r sets is called a 2-system if any two sets have the same intersection. Denote by F(n, r) the most number of subsets of an n-element set which do not contain a 2-system consisting of r sets. Constructive new lower bounds for F(n, r) are given which improve known probabilistic results, an