Seminar series
Date
Tue, 29 Nov 2016
14:30
14:30
Location
L6
Speaker
Imre Leader
Organisation
University of Cambridge
The Graham-Pollak theorem states that to decompose the complete graph $K_n$ into complete bipartite subgraphs we need at least $n-1$ of them. What
happens for hypergraphs? In other words, suppose that we wish to decompose the complete $r$-graph on $n$ vertices into complete $r$-partite $r$-graphs; how many do we need?
In this talk we will report on recent progress on this problem. This is joint work with Luka Milicevic and Ta Sheng Tan.