Seminar

Complete subgraphs of t-partite hypergraphs

Graphs, Hypergraphs, and Computing

17 April 15:30 - 16:30

-

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.
Organizers
Magnus M. Halldorsson
Reykjavik University
Klas Markström
Umeå University
Andrzej Rucinski
Adam Mickiewicz University
Carsten Thomassen
Technical University of Denmark, DTU

Program
Contact

Klas Markström

klas.markstrom@math.umu.se

Other
information

For practical matters at the Institute, send an e-mail to secretary@mittag-leffler.se