Imre Leader: Decomposing the complete r-graph

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. No knowledge
of the Graham-Pollak theorem is assumed. This is joint work with Luka
Milicevic and Ta Sheng Tan.

https://zoom.us/j/98689592820?pwd=SndCRGJoTzhwYkNCT0hNQnJIaXk3dz09
986 8959 2820
Passcode  618079