Imre Leader

University of Cambridge


Decomposing the Complete r-Graph


Combinatorics Seminar


28th February 2020, 11:00 am – 12:00 pm
Fry Building, LG.22


(NB: This is a special seminar taking place on a Friday, rather than the usual Tuesday.)

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.
This is joint work with Luka Milicevic and Ta Sheng Tan.





Organisers: David Ellis, Tom Johnston

Comments are closed.
css.php