Combinatorics, Probability and Algorithms

Mason Chair of Mathematics

Daniela's research interests lie in Extremal and Probabilistic Combinatorics, in particular in Extremal Graph Theory, hypergraphs and random structures.

Recently she used probabilistic methods to solve several problems on Hamilton cycles in graphs and digraphs as well as generalised matching problems.

Daniela Kühn profile

Professor in Graph Theory

The main research area of Deryk Osthus is Combinatorics. He currently works on random graphs, randomised algorithms, Ramsey theory and extremal graph theory. The problems studied are often computationally intractable.

So a successful approach has been to find sufficient conditions which ensure some desired structure or property. He has proved numerous results of this kind for Hamilton cycles and other spanning substructures.

Professor Deryk Osthus profile

Birmingham Fellow

Dr Johannes Carmesin Profile

Reader

Nikolaos' research interests are mainly related to the area of random discrete structures, the concept of pseudorandomness and its applications to extremal combinatorics as well as algorithms for information flow on networks.

The current focus of his research is on the analysis of graph-theoretic models for real-world networks. From this perspective, his current research has to do with random geometric graphs on spaces of negative curvature, exploring them as a candidate model for social networks.

Dr Nikolaos Fountoulakis profile

Birmingham Fellow

Allan’s research interests lie in extremal and probabilistic graph theory. A typical problem in this field is to determine the necessary condition for the existence of a fixed spanning subgraph (e.g. Hamilton cycle) in a graph, edge-coloured graph, orientated graph or hypergraph.

The current focus of his research is on graph decompositions.  For example (jointly with B. Csaba, D. Kuhn, D. Osthus and A. Treglown), he recently proved the 1-factorisation conjecture and Hamilton decomposition conjecture for large graphs.

Dr Allan Lo profile

Birmingham Fellow

Dr Richard Montgomery is a Birmingham Fellow, whose research interests lie primarily in Probabilistic and Extremal Combinatorics.

Dr Richard Montgomery profile

Senior Lecturer

Richard's research interests lie in the field of Extremal Graph Theory. A significant area of research in this field is to determine the existence of a fixed large or spanning subgraph within a graph, directed graph or hypergraph.

For example, Richard's recent work includes the use of a randomised embedding algorithm to prove Sumner's Universal Tournament Conjecture for large tournaments. This states (loosely) that any sufficiently large tournament contains any tree on roughly half the number of vertices.

More recently his focus has been on finding perfect matchings and packing's in hypergraphs.

Dr Richard Mycroft profile

Lecturer

Eoin's research interests encompass a wide array, including Extremal combinatorics, Graph Theory, Ramsey theory, Probabilistic methods in combinatorics and High-dimensional phenomena.

Dr Eoin Long profile

Lecturer

Matthew’s research interests lie at the interface of combinatorics, statistical physics and theoretical computer science. Much of his research aims to understand the emergence of large scale structure in systems governed only by local interactions.

Dr Matthew Jenssen profile

Senior Lecturer

Andrew’s primary research interests lie in extremal and probabilistic graph theory as well as in Ramsey theory.

Recently Andrew has been working on problems concerning graph decompositions including the 1-factorisation conjecture. With his coauthors, he solved a classical Ramsey problem of Goodman concerning the number of monochromatic triangles in three-coloured graphs. Andrew has also worked on a number of embedding problems in the directed graph and hypergraph setting.

Dr Andrew Treglown profile