University of Cambridge > Talks.cam > Combinatorics Seminar > The Graham-Pollak Problem for Hypergraphs

The Graham-Pollak Problem for Hypergraphs

Add to your list(s) Download to your calendar using vCal

  • UserImre Leader (University of Cambridge)
  • ClockThursday 28 February 2019, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

How many complete bipartite graphs do we need to decompose the complete graph on $n$ vertices? It is easy to achieve this with $n-1$ complete bipartite graphs, and the Graham-Pollak Theorem states that this is the minimum. What happens for hypergraphs? For example, how many complete tripartite 3-graphs do we need to decompose the complete 3-graph on $n$ vertices? We will report on recent progress on this question.

Joint work with Luka Milicevic and Ta Sheng Tan

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity