Department of Mathematical Sciences
Events
People
Colloquia and Seminars
Conferences
Centers
Positions
Areas of Research
About the Department
Alumni |
Algorithms, Combinatorics and Optimization Seminar
NYU Title: Counting Connected Graphs Abstract: Let C(n,k) be the number of labelled connected graphs with n vertices and n-1+k edges. For k=0 (trees) we have Cayley's Formula. We examine the asymptotics of C(n,k). There are several approaches involving supercritical dominant components in random graphs, local limit laws, Brownian excursions, Parking functions and other topics. Date: Thursday, October 27, 2016 Time: 3:30 pm Location: Wean Hall 8220 |