|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Random graphs from a minor-closed class
If you have a question about this talk, please contact Andrew Thomason.
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. We shall recall some background, and then use combinatorial and probabilistic methods to extend these results. We will consider random graphs from a `well-behaved’ class of graphs: examples of such classes include all minor-closed classes of graphs with 2-connected excluded minors (such as forests, series-parallel graphs and planar graphs), the class of graphs embeddable on any given surface, and the class of graphs with at most k vertex-disjoint cycles. Also, we will give weights to edges and components to specify probabilities, so that our random graphs correspond to the “random cluster” model, appropriately conditioned. We find that earlier results extend naturally in both directions, to general well-behaved classes of graphs, and to the weighted framework, for example results concerning the probability of a random graph being connected, and we also find new results on the 2-core.
This talk is part of the Combinatorics Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsCentre of African Studies Michaelmas Seminars British Computer Society SPA Cambridge All CMS events
Other talksModelling the Risks of Climate Change - Dr. Chris Hope The Solaris Project. A Timing Survey For Circumbinary Planets Around Eclipsing Binary Stars with a Global Network of Robotic Telescopes Mullard Radio Astronomy Observatory (MRAO) Tour * 10:30am - 12noon Tour of the Botanical Gardens Computational insights into stem cell differentiation using dynamic hybrid modelling. Provision of effective mental health services to sexual and gender minorities – Results from a systematic review of the literature (1980 – 2013