Density results for uniform families
From MaRDI portal
Publication:1323482
Assume that a \(k\)-partite family is given on some sets with \(n_ 1, \dots, n_ k\) elements. If the family has more than \(n_ 1n_ 2 \dots n_ k-(n_ 1-1) (n_ 2-1) \dots (n_ k-1)\) elements then there is a \(k\)-element set \(A\) all subsets of which occur as the intersection of some set in the family with \(A\). The proof goes by evaluating the rank of a certain matrix.
Recommendations
Cites work
- A combinatorial problem; stability and order for models and theories in infinitary languages
- An extremal problem for two families of sets
- Intersection patterns of convex sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On the density of families of sets
- On the density of sets of vectors
- On the number of sets in a null t-design
- On the trace of finite sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Cited in
(5)
This page was built for publication: Density results for uniform families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323482)