Seminars & Colloquia Calendar

Download as iCal file

Discrete Math

Decomposing the complete r-graph

Imre Leader, Cambridge

Location:  Hill 705
Date & time: Monday, 24 September 2018 at 2:00PM - 3:00PM


The Graham-Pollak theorem states that, if we wish to decompose the complete graph on n vertices into complete bipartite subgraphs, we need at least n-1. What happens for hypergraphs? We will present background and also some recent results.

This is joint work with Luka Milicevic and Ta Sheng Tan.

Special Note to All Travelers

Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.

Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.