Prof Nick Wormald

Research Overview

Combinatorics; Random Graphs; Graph Theory; Enumeration of Graphs, Maps and Combinatorial Structures; Probabilistic Combinatorics; Combinatorial and Graph Algorithms; Shortest Networks and Steiner Trees; Underground Mine Optimisation.

See personal web page for more information.

Selected Publications

[1] Liebenau, Anita ; Wormald, Nicholas. "Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph". https://arxiv.org/abs/1702.08373

[2] Pittel, Boris ; Spencer, Joel ; Wormald, Nicholas. "Sudden emergence of a giant k-core in a random graph". In: Journal of Combinatorial Theory, Series B. 1996 ; Vol. 67, No. 1. pp. 111-151. https://doi.org/10.1006/jctb.1996.0036

[3] Wormald, Nicholas Charles. "Differential equations for random processes and random graphs". In: Annals of Applied Probability. 1995 ; Vol. 5. pp. 1217-1235.

[4] Robinson, R. W. ; Wormald, N. C. "Almost all regular graphs are hamiltonian". In: Random Structures & Algorithms. 1994 ; Vol. 5, No. 2. pp. 363-374. https://doi.org/10.1002/rsa.3240050209

[5] Spencer, Joel ; Wormald, Nicholas. "Birth control for giants". In: Combinatorica. 2007 ; Vol. 27, No. 5. pp. 587-628. https://doi.org/10.1007/s00493-007-2163-2