School of Mathematical Sciences

Decomposing the complete hypergraph menu

Decomposing the complete hypergraph

Speaker: 
Imre Leader (Cambridge)
Date/Time: 
Fri, 13/10/2017 - 16:00
Room: 
Queens Building, W316

The Graham-Pollak theorem asserts that, to decompose the complete graph on n vertices into complete bipartite subgraphs, we need at least n-1. What happens for hypergraphs: how many complete r-partite r-graphs are needed to decompose the complete r-graph? (Joint work with Luka Milicevic and Ta Sheng Tan.)