19 citations · 21 across the 4 of their papers we have counts for
4 papers · 1 filter
Graph classes with given 3-connected components: asymptotic enumeration and random graphs
Omer Gimenez, Marc Noy, Juanjo Rue
Consider a family of 3-connected graphs of moderate growth, and let be the class of graphs whose 3-connected components are graphs in . We…
On the number of graphs not containing as a minor
S. Gerke, O. Gimenez, M. Noy +1
We derive precise asymptotic estimates for the number of labelled graphs not containing as a minor, and also for those which are edge maximal. Additionally, we establish…
Enumeration and limit laws of series-parallel graphs
Manuel Bodirsky, Omer Gimenez, Mihyun Kang +1
We show that the number of labelled series-parallel graphs on vertices is asymptotically , where and are explicit computable cons…
Asymptotic enumeration and limit laws of planar graphs
Omer Gimenez, Marc Noy
We show an asymptotic estimate for the number of labelled planar graphs on vertices. We also find limit laws for the number of edges, the number of connected components, and ot…