• Start Date: September 24, 2018
  • Event Start Time: 2:00 PM
  • Event End Time: 3:00 PM
  • Seminar Series: Rutgers Discrete Mathematics Seminar
  • Presenter(s): Imre Leader - University of Cambridge
  • Event Location: Hill Center-Room 705
  • Presentation Type: Stand Alone Presentation
  • Abstract:

    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.