BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The Graham-Pollak Problem for Hypergraphs - Imre Leader (Universit
 y of Cambridge)
DTSTART:20190228T143000Z
DTEND:20190228T153000Z
UID:TALK120802@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:How many complete bipartite graphs do we need to decompose the
  complete\ngraph on $n$ vertices? It is easy to achieve this with $n-1$ co
 mplete\nbipartite graphs\, and the Graham-Pollak Theorem states that this 
 is\nthe minimum. What happens for hypergraphs? For example\, how many\ncom
 plete tripartite 3-graphs do we need to decompose the complete\n3-graph on
  $n$ vertices? We will report on recent progress on this\nquestion.\n\nJoi
 nt work with Luka Milicevic and Ta Sheng Tan\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR