Klas Markström: Complete subgraphs of t-partite hypergraphs

A few years ago Bondy, Thomassé and Thomassen solved the following problem: Given a three-partite graph G, which densities of the induced bipartite subgraphs force the existence of a triangle in G? Later the problem of counting the number of triangles in the same situation was studied by Barber, Johnson and Talbot.

I will discuss an extension of some of these results to the case of r-uniform hypergraphs.