Non-uniform Turán-type problems (Q2484510)

For positive integers \(n,t,k\) where \(2 \leq k \leq n,\) and \(t< 2^n\) a family of (non-empty) subsets of \([n]\) is a \((k,t)\) system, if every \(k\)-subset of \([n]\) contains at least \(t\) elements of the family, while every \((k-1)\)-subset of \([n]\) contains at most \(t-1\) elements of the family. This paper determines the order of magnitude of \(m(n,k,t)\) which denotes the minimum size of a \((k,t)\) system. The notion of \((k,t)\) systems came from computer science, and the proof uses an Erdős-Simonovits result from extremal hypergraph theory.