Restricted problems in extremal combinatorics (Q6198640)

In this paper, the author considers extremal problems for uniform hypergraphs by investigating a variant of the classical extremal problem (posed by Turán about 80 years ago) for hypergraphs by imposing additional restrictions on the distribution of the hyperedges. Roughly speaking, uniformly dense hypergraphs were considered, i.e., hypergraphs that induce on large sets of vertices at least a given edge density. This additional assumption yields better control over the corresponding extremal problem. This leads to many interesting and sometimes more manageable subproblems, some of which were already considered by \textit{P. Erdős} and \textit{V. T. Sós} [Combinatorica 2, 289--295 (1982; Zbl 0511.05049)] and \textit{P. Erdős} and \textit{A. Hajnal} [``On Ramsey like theorems. Problems and results'', in: Combinatorics. Proceedings of the conference on combinatorial mathematics held at the Mathematical Institute, Oxford, 3--7 July, 1972. Southend-on-Sea: The Institute of Mathematics and its Applications. 123--140 (1972)]. In particular, those additional assumptions on the hyperedge distribution are closely related to the theory of quasirandom hypergraphs and make these problems amenable to the regularity method for hypergraphs. In fact, the hypergraph extensions by \textit{W. T. Gowers} [Ann. Math. (2) 166, No. 3, 897--946 (2007; Zbl 1159.05052)] and by \textit{V. Rödl} and \textit{J. Skokan} [Random Struct. Algorithms 25, No. 1, 1--42 (2004; Zbl 1046.05042)] of the regularity lemma provide essential tools for this line of research. The paper includes almost no proof, but many examples and interesting open problems in this area. For the entire collection see [Zbl 07816360].