Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,217,186 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Algorithmica
Combinatorica
Combinatorics, Probability and Computing
Graph theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On Wormald's differential equation method
L. Warnke
arXiv.org
2019
Corpus ID: 162168579
This note contains a short and simple proof of Wormald's differential equation method (that yields slightly improved…
Expand
2016
2016
Complex martingales and asymptotic enumeration
M. Isaev
,
B. McKay
Random Struct. Algorithms
2016
Corpus ID: 49339277
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be…
Expand
2015
2015
How does the core sit inside the mantle?
A. Coja-Oghlan
,
Oliver Cooley
,
Mihyun Kang
,
Kathrin Skubch
Random Struct. Algorithms
2015
Corpus ID: 9597023
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…
Expand
Review
2005
Review
2005
The student review of the science curriculum
Ian Murray
,
M. Reiss
2005
Corpus ID: 143591076
This paper presents some of the main findings of a student-led review of the science curriculum in England. Over 350 students…
Expand
2002
2002
Highly Arc-Transitive Digraphs With No Homomorphism Onto Z
A. Malnic
,
D. Marušič
,
N. Seifter
,
B. Zgrablic
Comb.
2002
Corpus ID: 18876605
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…
Expand
Highly Cited
2002
Highly Cited
2002
On the asymmetry of random regular graphs and random graphs
J. Kim
,
B. Sudakov
,
V. Vu
Random Struct. Algorithms
2002
Corpus ID: 12050804
This paper studies the symmetry of random regular graphs and random graphs. Our main result shows that for all 3 ≤ d ≤ n − 4 the…
Expand
1999
1999
The Size of the Largest Components in Random Planar Maps
Zhicheng Gao
,
N. Wormald
SIAM Journal on Discrete Mathematics
1999
Corpus ID: 7283545
Bender, Richmond, and Wormald showed that in almost all planar 3-connected triangulations (or dually, 3-connected cubic maps…
Expand
1998
1998
More on the linear k-arboricity of regular graphs
R. Aldred
,
N. Wormald
The Australasian Journal of Combinatorics
1998
Corpus ID: 17188623
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…
Expand
1991
1991
Uniform cyclic edge connectivity in cubic graphs
R. Aldred
,
D. Holton
,
B. Jackson
Comb.
1991
Corpus ID: 12197777
A cubic graph which is cyclicallyk-edge connected and has the further property that every edge belongs to some cyclick-edge cut…
Expand
1985
1985
Subsynchronous Vibration Problems In High-Speed, Multistage Centrifugal Pumps.
Ian Massey
1985
Corpus ID: 56367862
Ian Massey is Director of Engineering of the Pacific Pumps Division of Dresser Industries, Incorporated. Prior to join ing…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE