A new approach to Turán's conjecture (Q1066899)

Let t(n,r,k) denote the minimum size of a family \({\mathcal G}\) of k-element subsets of an n-element set X such that any r-subset of X contains a member of \({\mathcal G}\), i.e. a k-uniform hypergraph without an independent set of size r. Such a hypergraph will be called an (r,k)-graph. Turán's conjecture is concerned with (4,3)-graphs. In this note some related conjectures are stated.