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)

Related topics

Related topics

7 relations
AlgorithmicaCombinatoricaCombinatorics, Probability and ComputingGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Peeling Algorithm on Random Hypergraphs with Superlinear Number of Hyperedges
When we try to solve a system of linear equations, we can consider a simple iterative algorithm in which an equation including… 
2011
2011
Exchangeable Pairs, Switchings, and Random Regular Graphs
We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph's spectral… 
2008
2008
Properties of graphs with large girth
This thesis is devoted to the analysis of a class of iterative probabilistic algorithms in regular graphs, called locally greedy… 
Review
2005
Review
2005
5-Regular Multi-Graphs are 3-Colorable with Independent of their Size Positive Probability ?
We show that uniformly random 5-regular multi-graphs of n vertices, n even, are 3-colorable with probability that is positive… 
2005
2005
Approximating the Longest Cycle Problem on Graphs with Bounded Degree
In 1993, Jackson and Wormald conjectured that if G is a 3-connected n-vertex graph with maximum degree d≥ 4 then G contains a… 
2002
2002
Highly Arc-Transitive Digraphs With No Homomorphism Onto Z
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… 
1998
1998
More on the linear k-arboricity of regular graphs
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… 
1995
1995
Iterative histogram modification of gray images
We develop an iterated histogram modification algorithm for enhancing gray images. The modified image has very few gray levels… 
1993
1993
Counting bichromatic evolutionary trees
We give a short and transparent bijective proof of the bichromatic binary tree theorem of Carter, Hendy, Penny, Sztkely and… 
1984
1984
Overwintering and Survival of Pseudomonas syringae pv. syringae and Symptom Development in Peach Trees
yr-old trees (Prunuspersica 'Redhaven') per twig and eight twigs per treatment for each sampling. 
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)