MathCS Seminar

Title: Decomposing the Complete r-Graph
Seminar: Combinatorics
Speaker: Imre Leader of The University of Cambridge
Contact: Dwight Duffus,
Date: 2016-09-28 at 4:00PM
Venue: W301
Download Flyer
The Graham-Pollak theorem states that, if we wish to decompose the complete graph Kn into complete bipartite subgraphs, then we need at least n-1 of them. What happens for hypergraphs? In other words, if 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 report on recent progress on this question. This is joint work with Luka Milicevic and Ta Sheng Tan.

See All Seminars