The intersection structure of t-intersecting families
From MaRDI portal
Publication:2571311
Let \(1 \leq r \leq n\) and \(t \leq k \leq r\) be integers. This short note proves an asymptotically sharp result on the maximal number of different \(k\)-element subsets occuring as pairwise intersection.
Recommendations
Cited in
(10)- Intersection graphs for families of balls in \(R^n\)
- A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
- On cross t-intersecting families of sets
- The structure of large non-trivial \(t\)-intersecting families of finite sets
- A note on kernels of intersecting families
- Structure and supersaturation for intersecting families
- G-intersecting families
- Intersective sets given by a polynomial
- Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families
- The Profile Polytope of Nontrivial Intersecting Families
This page was built for publication: The intersection structure of \(t\)-intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571311)