A note on kernels of intersecting families (Q2277266)

Use \(n_ t(r)\) to denote the minimal n such that, for an r-graph F, there is an n-subset K of the vertices of F such that, for any \(\{F_ i\}\in F\) \((i=1,2,...,t)\), one has the intersection of all \(F_ i\) with K as non-null. A lower bound is obtained for this number.