Complete \(r\)-partite subgraphs of dense \(r\)-graphs (Q1043950)

Let \(U1, \dots, Ur\) be sets of size \(n\) and \(U\) their Cartesian product. Let \(M\) be a fixed subset of \(U\) of relative size at least a. Let \(V1, \dots, Vr\) be subsets of \(U1, \dots, Ur\) and \(V\) their Cartesian product. Assume that the size of \(V\) is at most \(ln(n)\). By specifying a lower bound to a in terms of \(n\) and \(r\) it is possible to find a lower bound to the number of sets \(V\) contained in \(M\). For \(r\) larger than 2 this extends a classical result of Erdős on complete bipartite graphs.