COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

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

## The Graham-Pollak Problem for HypergraphsAdd to your list(s) Download to your calendar using vCal - Imre Leader (University of Cambridge)
- Thursday 28 February 2019, 14:30-15:30
- MR12.
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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsType the title of a new list here Quantum Fluids Sustainable Resources Research Group## Other talksThe neural basis of time-extended semantic cognition: evidence from fMRI and TMS investigations Epidemiology of Ovarian Cancer The Algorithm is Going to Get You: Should We Fear the Rise of Artificial Intelligence in Criminal Justice? Curve fitting, errors and analysis of binding data Helices under the microscope: What geometry can tells us about the bundling and tangling of bacterial flagella Special Seminars |