On the kernel of intersecting families
From MaRDI portal
Let \({\mathcal F}\) be a t-wise s-intersecting family, i.e., \(| F_ 1\cap...\cap F_ t| \geq s\) holds for every t members of \({\mathcal F}\). Then there exists a set Y such that \(| F_ 1\cap...\cap F_ t\cap Y| \geq s\) still holds for every \(F_ 1,...,F_ t\in {\mathcal F}\). Here exponential lower and upper bounds are proven for the possible sizes of Y.
Recommendations
Cites work
- A simple proof of the upper bound theorem
- An extremal problem for sets with applications to graph theory
- An extremal problem for two families of sets
- Critical hypergraphs and interesting set-pair systems
- Finite projective spaces and intersecting hypergraphs
- Geometrical solution of an intersection problem for two hypergraphs
- scientific article; zbMATH DE number 3884215 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 3204639 (Why is no real title available?)
- Interpolation of functions over a measure space and conjectures about memory
- Intersection patterns of convex sets
- On intersecting families of finite sets
Cited in
(7)- t-expansive and t-wise intersecting hypergraphs
- A general framework for discovering and proving theorems of the Erdős- Ko-Rado type
- Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
- Matchings and covers in hypergraphs
- A note on kernels of intersecting families
- The structure of large intersecting families
- On finite set-systems whose every intersection is a kernel of a star
This page was built for publication: On the kernel of intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106213)
