COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Connectivity in graph classesAdd to your list(s) Download to your calendar using vCal - Guillem Perarnau Llobet (Birmingham)
- Thursday 29 October 2015, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason. A class of graphs is bridge-addable if, given a graph G in the class, any graph obtained by adding an edge between two connected components of G is also in the class. We prove a conjecture of McDiarmid, Steger and Welsh, that says that if G_n is taken uniformly at random from a class of bridge-addable graphs on n vertices, then G_n is connected with probability at least exp(-1/2)+o(1), when n tends to infinity. This lower bound is asymptotically best possible and it is reached for the class of forests. Our proof uses a “local double counting” strategy that enables us to compare the size of two sets of combinatorial objects by solving a related multivariate optimization problem. In our case, the optimization problem deals with partition functions of trees weighted by a supermultiplicative functional. This is joint work with Guillaume Chapuy. This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsUniversity of Cambridge Kendo Society Food Futures in the World Experience Islam Week 2011 (12th February - 20th February) The International Year of Statistics 2013 - Series of Public Lectures Centre of South Asian Studies Seminars Philomathia Social Sciences Research Programme## Other talksElectron Catalysis How language variation contributes to reading difficulties and “achievement gaps” Communicating Your Research to the Wider World The quasi-stationary nature of ‘steady-state’ cyclic deformation Algorithmic Investigation of Large Biological Data sets |