Set systems with three intersections
From MaRDI portal
Let X be a finite set of cardinality n and \({\mathcal F}^ a \)family of \(4a+5\)-element subsets of X, \(a\geq 6\). Suppose that all the pairwise intersections of members of \({\mathcal F}\) have cardinality 0, a or \(2a+1\). The author proves that \(c_ 1n^{4/3}<\max | {\mathcal F}| <c_ 2n^{4/3}\) for some positive \(c_ 1\), \(c_ 2\).
Recommendations
- Intersection theorems for systems of sets (III)
- Set-systems with restricted multiple intersections
- Families of finite sets with three intersections
- Intersections of simple threefold directed triple systems
- Intersection Theorems for Systems of Sets
- An intersection theorem for systems of sets
- Intersection statements for systems of sets
- Union-intersecting set systems
- Intersection Properties of Systems of Finite Sets
- scientific article; zbMATH DE number 3596845
Cites work
- Families of finite sets with prescribed cardinalities for pairwise intersections
- Families of finite sets with three intersections
- Intersection Theorems for Systems of Sets
- On coloring graphs to maximize the proportion of multicolored k-edges
- On finite set-systems whose every intersection is a kernel of a star
- On set intersections
- On t-designs
Cited in
(7)- Ranks of matrices with few distinct entries
- Three-variable statements of set-pairing
- scientific article; zbMATH DE number 4210195 (Why is no real title available?)
- Linearity of cardinality for 3-nonlinked families of sets
- Constructing set systems with prescribed intersection sizes
- On an extremal problem of set system
- Set systems without a 3-simplex
This page was built for publication: Set systems with three intersections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062054)
