Skip to search formSkip to main contentSkip to account menu

Nick Wormald

Known as: Nicholas Charles Wormald, Wormald 
Nicholas Charles Wormald is an Australian mathematician and professor of mathematics at Monash University. He specializes in probabilistic… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
This note contains a short and simple proof of Wormald's differential equation method (that yields slightly improved… 
2016
2016
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be… 
2015
2015
The k‐core, defined as the maximal subgraph of minimum degree at least k, of the random graph G(n,p) has been studied extensively… 
Review
2005
Review
2005
This paper presents some of the main findings of a student-led review of the science curriculum in England. Over 350 students… 
2002
2002
In an infinite digraph D, an edge e' is reachable from an edge e if there exists an alternating walk in D whose initial and… 
Highly Cited
2002
Highly Cited
2002
This paper studies the symmetry of random regular graphs and random graphs. Our main result shows that for all 3 ≤ d ≤ n − 4 the… 
1999
1999
Bender, Richmond, and Wormald showed that in almost all planar 3-connected triangulations (or dually, 3-connected cubic maps… 
1998
1998
Bermond et al. [5] conjectured that the edge set of a cubic graph G can be partitioned into two linear k-forests, that is to say… 
1991
1991
A cubic graph which is cyclicallyk-edge connected and has the further property that every edge belongs to some cyclick-edge cut… 
1985
1985
Ian Massey is Director of Engineering of the Pacific Pumps Division of Dresser Industries, Incorporated. Prior to join­ ing…