Evènement pour le groupe Combinatoire Énumérative et Algébrique


Date 2012-04-06  10:45-11:45
TitreCombinatorics of minor-closed classes of graphs 
RésuméIn the past few years there has been a growing interest in finding properties of minor-closed 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 minor-closed classes, where the forbidden minors are 2-connected. 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 2-connected using tools from analytic combinatoric as well as methods from graph theory. 
Lieu076 
OrateurKerstin Weller 
EmailKerstin.Weller@maths.ox.ac.uk 
UrlMathematical Institute, University of Oxford, Angleterre 



Aucun document lié à cet événement.

Retour
Retour à l'index