The main research interests of our group lie in Combinatorics, the study of Random Discrete Structures and the analysis of Randomized Algorithms. Combinatorial structures of particular interest are graphs and hypergraphs. Indeed, large graphs underpin much of modern society and science, and can be used to model networks in biology, sociology or computer science. These models give rise to a variety of challenging computational problems. The probabilistic perspective arises both as an invaluable method of proof as well as through the analysis of typical properties of combinatorial objects. We are always keen to hear from talented students who are interested in these topics and would like to pursue PhD study in this area.
|
 |
Past Events
WHO ARE WE?
-
Daniela Kühn
Daniela's research interests lie mainly in Extremal and Probabilistic Combinatorics, as well as algorithmic applications. In particular, she used probabilistic methods to solve several problems on Hamilton cycles in graphs and digraphs, graph decompositions and hypergraph matchings.
-
Deryk OsthusDeryk's research interests are in extremal graph theory, random graphs, randomized algorithms, structural graph theory as well as Ramsey theory. His recent research has included results on Hamilton cycles and more general spanning substructures, as well as decompositions of graphs and hypergraphs. -
Nikolaos Fountoulakis
Nikolaos' research interests are mainly related to the area of random discrete structures and the analysis of random processes on graphs and their connections with theoretical computer science and average-case analysis. His most recent work has focused on the development of the theory of random graphs on the hyperbolic plane and its applications to the theory of complex networks. He is also interested in percolation phenomena in large finite structures.
-
Richard MycroftRichard's research is primarily in the field of extremal graph theory. Recent results include general sufficient conditions which ensure the existence of perfect matchings and Hamilton cycles in hypergraphs, or which permit the construction of efficient algorithms to find such structures (should they exist). -
Andrew Treglown
Andrew's primary research interests lie in Extremal and Probabilistic Combinatorics as well as in Ramsey Theory and Combinatorial Number Theory. He is also interested in graph decompositions and on a number of embedding problems in the directed graph and hypergraph setting.
-
Allan LoAllan's research interests lie in Extremal and Probabilistic Graph Theory. A typical problem in this field is to determine the necessary conditions for the existence of a fixed spanning subgraph in a graph, edge-coloured graph, orientated graph or hypergraph. -
Eoin Long
Eoin's research interests lie in extremal and probabilistic combinatorics, with a emphasis on extremal set theory, graph theory, probabilistic methods in combinatorics, and high-dimensional phenomena. Recently his work has focused on discrete isoperimetric inequalities, graph Ramsey theory and intersection theorems for finite sets.
