• Start Date: March 13, 2019
  • Event Start Time: 12:15 PM
  • Event End Time: 1:15 PM
  • Seminar Series: Graduate Combinatorics Seminar
  • Presenter(s): Keith Frankston - Rutgers University
  • Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
  • Presentation Type: Stand Alone Presentation
  • Abstract:

    Cayley's formula states that the number of labeled spanning trees of K_n is n^{n-2}. How many of those spanning trees contain a fixed forest? Can you generate a uniformly random spanning tree algorithmically? Can you generate a uniformly random spanning tree containing a fixed forest? We will answer some subset of these questions; come to the talk to find out which ones!