Sebi Cioaba,
Department of Computer Science, University of Toronto

On decompositions of hypergraphs

Abstract:

A classical theorem of Graham and Pollak states that the minimum number of complete bipartite subgraphs needed to partition the edge set of a complete graph on n vertices is n-1. I will talk about extensions of this result to hypergraphs as well as other variants of this problem.