Unavoidable traces of set systems (Q2368593)

\textit{N. Sauer} [J. Comb. Theory, Ser. A 13, 145--147 (1972; Zbl 0248.05005)], \textit{S. Shelah} [Pac. J. Math. 41, 247--261 (1972; Zbl 0239.02024)] and \textit{V. N. Vapnik} and \textit{A. Ya. Chervonenkis} [Theor. Probab. Appl. 16, 264--280 (1971; Zbl 0247.60005)] showed that if a hypergraph on \(n\) vertices contains sufficiently many edges then it contains a full trace on some large set. \textit{P. Frankl} and \textit{J. Pach} [Combinatorica 4, 39--45 (1984; Zbl 0534.05003)] obtained results of the same spirit for the case when the size of the ground set is not bounded. In this paper three sequences of structures are given such that every set system consisting of sufficiently many sets contains at least one of these structures with many sets.