N. Wormald

activity

20052010

most citedAn improved upper bound on the length of the longest cycle of a supercritical random graph

3 citations · 8 across the 12 of their papers we have counts for

collaborators

Showing 2010 · math.COShow all

2 papers · 2 filters

math.CO2010★ 1 cited

Induced subgraphs in sparse random graphs with given degree sequence

Pu Gao, Yi Su, Nicholas Wormald

For any $S \subset [n]$ , we compute the probability that the subgraph of $G_{n, d}$ induced by $S$ is a given graph $H$ on the vertex set $S$ . The result holds for any $d=o…

math.CO2010

Asymptotic enumeration of sparse 2-connected graphs

Graeme Kemkes, Cristiane M. Sato, Nicholas Wormald

We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m - n \to \infty$ and $m = O (n lo g n)$ as $n\to\in…