Publications (23)
Asymptotic enumeration of strongly connected digraphs by vertices and edges
Xavier Perez-Gimenez, Nicholas Wormald
The diameter of sparse random graphs
Oliver Riordan, Nicholas Wormald
Induced forests in regular graphs with large girth
Carlos Hoppen, Nicholas Wormald
High degree graphs contain large-star factors
Noga Alon, Nicholas Wormald
On the chromatic number of random d-regular graphs
Graeme Kemkes, Xavier Pérez-Giménez, Nicholas Wormald
Enumeration of graphs with a heavy-tailed degree sequence
Pu Gao, Nicholas Wormald
Meyniel's conjecture holds for random d-regular graphs
Pawel Pralat, Nicholas Wormald
Cycle factors and renewal theory
Jeff Kahn, Eyal Lubetzky, Nicholas Wormald
The mixing time of the giant component of a random graph
Itai Benjamini, Gady Kozma, Nicholas Wormald
An improved upper bound on the length of the longest cycle of a supercritical random graph
Graeme Kemkes, Nicholas Wormald
Induced subgraphs in sparse random graphs with given degree sequence
Pu Gao, Yi Su, Nicholas Wormald
On the degree distribution of a growing network model
Linda Farczadi, Nicholas Wormald
Rainbow Hamilton cycles in random regular graphs
Svante Janson, Nicholas Wormald
A limit theorem for the six-length of random functional graphs with a fixed degree sequence
Kevin Leckey, Nicholas Wormald
On the threshold for k-regular subgraphs of random graphs
Pawel Pralat, Jacques Verstraete, Nicholas Wormald
Expansion properties of a random regular graph after random vertex deletions
Catherine Greenhill, Fred B. Holt, Nicholas Wormald
Orientability thresholds for random hypergraphs
Pu Gao, Nicholas Wormald
Uniform generation of random graphs with power-law degree sequences
Pu Gao, Nicholas Wormald
Local algorithms, regular graphs of large girth, and random regular graphs
Carlos Hoppen, Nicholas Wormald
On the hardness of sampling independent sets beyond the tree threshold
Elchanan Mossel, Dror Weitz, Nicholas Wormald
The threshold for combs in random graphs
Jeff Kahn, Eyal Lubetzky, Nicholas Wormald
Regular induced subgraphs of a random graph
Michael Krivelevich, Benny Sudakov, Nicholas Wormald
Asymptotic enumeration of sparse 2-connected graphs
Graeme Kemkes, Cristiane M. Sato, Nicholas Wormald