Imre Leader, University of Cambridge

Abstract

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.