Seminars & Colloquia Calendar
Decomposing the complete r-graph
Imre Leader, Cambridge
Location: Hill 705
Date & time: Monday, 24 September 2018 at 2:00PM - 3:00PM
The Graham-Pollak theorem states that, if we wish to decompose the complete graph on n vertices into complete bipartite subgraphs, we need at least n-1. What happens for hypergraphs? We will present background and also some recent results.
This is joint work with Luka Milicevic and Ta Sheng Tan.