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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The Graham-Pollak Problem for Hypergraphs

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Women in Media Soc djl82's list The obesity epidemic: Discussing the global health crisis

Other talks

In conversation: Louis Herns Marcelin and Ola Osman on legacies of enslavement and contemporary violence in Liberia and Haiti TBC Favourite Plants: the common, the captivating, and the curious Talk title TBC Spectral theory for Dirac operators with singular potentials Chemical strategies for biomolecule functionalisation, and biomaterial conjugation
 

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