Campus Event Calendar
Event Entry
What and Who
3-connected cores in random biconnected graphs
Nikolaos Fountoulakis
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, AG 4, RG1, MMCI, AG 3, AG 5, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 31 July 2009
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
We investigate random 2-connected graphs whose 3-connected building blocks (which are called the ``cores") are sampled from a given family of 3-connected graphs. We provide a critical condition which
determines the (with high probability) existence of a ``giant"
3-connected core in a random 2-connected graph. Furthermore, we
provide a complete description of the typical structure of such a
random 2-connected graph, giving sharp concentration results about
the numbers and the sizes of smaller 3-connected cores.
In particular, our results apply to random 2-connected
planar graphs, where we give such a detailed description.
(This is joint work with Konstantinos Panagiotou)
Contact
Nikolaos Fountoulakis
--email hidden
passcode not visible
logged in users only
Nikolaos Fountoulakis, 07/23/2009 16:19 -- Created document.