School of Mathematical Sciences

Research menu

Error message

Notice: Undefined index: HTTP_ACCEPT_LANGUAGE in include_once() (line 2 of /var/www/sites/default/settings.php).


Members of the Combinatorics Group: some thumbnail sketches

This page gives sketches of our research interests, links to our personal web pages, our author profiles in MathSciNet and our entries in the Mathematics Genealogy Project. Many of us keep details of our teaching and research on our personal web pages. The MathSciNet author profiles give access to

  • up-to-date lists and reviews of our publications,
  • our citation counts since 2000 with lists of most cited papers,
  • our co-authors and collaboration data.

(Note that a MathSciNet subscription is necessary to access these pages.) From the Mathematics Genealogy Project you can find our mathematical ancestors and descendants.

David Ellis

David Ellis works in combinatorics and discrete analysis. He is particularly interested in connections between combinatorics and other areas of mathematics, such as algebra, analysis and probability theory. Much of his work to date has involved the application of techniques from discrete Fourier analysis and representation theory to solve problems in extremal combinatorics. Within extremal combinatorics, he is interested in Erdős–Ko–Rado type problems, isoperimetric inequalities and Turán-type problems, amongst others. He is also particularly interested in the combinatorics of finite groups, especially non-Abelian groups.

Web page | MathSciNet profile | Genealogy

Bill Jackson

Bill Jackson's interests are in combinatorics, particularly graph theory, matroid theory, combinatorial geometry and combinatorial algorithms. He is currently working on problems concerning the rigidity of frameworks and graph polynomials.

Web page | MathSciNet Profile | Genealogy

Mark Jerrum

Mark J

Mark Jerrum is interested in combinatorics, computational complexity and stochastic processes. All of these ingredients come together in the study of randomised algorithms: computational procedures that exploit the surprising power of making random choices. A strong theme in this work is the analysis of the mixing time of combinatorially or geometrically defined Markov chains.

Web page | MathSciNet Profile | Genealogy

J. Robert Johnson

Robert Johnson's research is in combinatorics and graph theory. He is particularly interested in extremal combinatorics, and problems at the interface of graphs and set systems.

Web page | MathSciNet Profile | Genealogy

Dudley Stark


Dudley Stark works in probabilistic combinatorics, the study of randomly chosen combinatorial structures. The motivation for his field is twofold. Firstly, combinatorial objects with average properties may be difficult to construct explicitly and so proving their existence may require probabilistic methods. Secondly, randomly chosen combinatorial structures can be good models for physical or computational systems.

Web page | MathSciNet Profile | Genealogy

Mark Walters

Mark Walters' interests lie in Combinatorics and Probability with particular emphasis on their overlap. This includes Percolation, and the use of the probabilistic method in combinatorics. In Percolation Theory the bulk of his work has been on Continuum Percolation or Random Geometric Graphs. He is also interested in Ramsey Theory.

Web page | MathSciNet Profile | Genealogy