Nick Wormald
Nicholas Charles "Nick" Wormald (born before 1979) is an Australian mathematician who specializes in combinatorics and optimization.
Wormald received his doctorate in 1979 from the University of Newcastle under Robert William Robinson ( Some problems in the enumeration of labeled graphs ). He was a professor at the University of Melbourne and the University of Auckland before moving to the University of Waterloo in 2006 , where he held the Canada Research Chair in Combinatorics and Optimization.
He deals with probabilistic combinatorics, graph theory, enumerative combinatorics, combinatorial algorithms, Steiner trees , with applications, among other things, to the optimization of mines in mining.
In 1979 he solved a problem by Paul Erdős about the coloring of graphs (endowed by Erdős with 25 dollars). He used a computer to construct a flat set with 6448 points without equilateral triangles of length 1, whose corresponding graph (points were connected if distance 1) could not be colored with three colors (chromatic number 4), contrary to Erdös' assumption and to his surprise.
In 2006 he received the Euler Medal and the Research Medal from the Australian Mathematical Society . In 2012 he received an Australian Laureate Fellowship and in 2017 he was elected as a member of the Australian Academy of Science .
Web links
Individual evidence
- ^ Mathematics Genealogy Project
- ^ The ICA Medals. Institute of Combinatorics and its Applications, accessed June 15, 2018 .
| personal data | |
|---|---|
| SURNAME | Wormald, Nick |
| ALTERNATIVE NAMES | Wormald, Nicholas Charles |
| BRIEF DESCRIPTION | Australian mathematician |
| DATE OF BIRTH | before 1979 |