
Evènement pour le groupe Combinatoire Énumérative et Algébrique
Date  20120406 10:4511:45 
Titre  Combinatorics of minorclosed classes of graphs 
Résumé  In the past few years there has been a growing interest in finding properties of minorclosed classes of graphs. Typical examples of such properties are the number of graphs on n vertices, the probability that a graph on n vertices taken uniformly at random is connected etc. One of the first classes to be analyzed was the class of planar graphs and in fact many results known in this context extend to minorclosed classes, where the forbidden minors are 2connected. In this talk, I am going to survey some well known results and present some examples indicating what might happen if we drop the condition that the excluded minors are 2connected using tools from analytic combinatoric as well as methods from graph theory. 
Lieu  076 
Orateur  Kerstin Weller 
Email  Kerstin.Weller@maths.ox.ac.uk 
Url  Mathematical Institute, University of Oxford, Angleterre 
Aucun document lié à cet événement. RetourRetour à l'index
 