Skip to content

Discrete Mathematics

The main area of research for the research group in Discrete Mathematics has been classical topics in the theory of graphs and hypergraphs.

Research in the group covers a wide range of areas within discrete mathematics: 

 - extremal combinatorics (which is concerned with determining the extreme possible values of a parameter in a discrete structure such as a graph or hypergraph, subject to some constraint)

 - discrete probability (the study of discrete random structures, such as random graphs)

 - algorithmic combinatorics (finding fast algorithms for giving exact or approximate solutions to combinatorial optimisation problems  or combinatorial games)

 - computational combinatorics (problems about the enumerations of discrete structures with given properties)

Past members

Lan Anh Pham (PhD 2015-2019)

Denys Shcherbak (PhD 2015-2019)

Jakub Sliacabn (now a software engineer at Red Hat in Brno)

Nicolás Sanhueza-Matatamala (now a postdoc at the Institute of Computer Science of the Czech Academy of Sciences)

Robert Hancock (now a postdoc at Masaryk University in Brno, Czech Republic) 

Joel Larsson (now a postdoc at the University of Warwick) 

Fei Song 

Carl-Johan Casselgren (now an associate professor at Linköping Universitet)

Allan Siu-Lun Lo (now a Lecturer at the University of Birmingham) 

Demetrius Christofides (now an assistant professor at UCLAN Cyprus) 

Daniel Andrén (now an associate professor at Mälardalen University)

Lars Hellström (now an associate professor at Mälardalen University)

Jonathan Cutler (now an associate professor at Montclair State University, New Jersey, USA) 

Anders Johansson (now an associate professor at Gävle Universitet) 

Probabilistic Midwinter Meeting January 15-16 2020
Probabilistic Midwinter Meeting January 15-16 2020

On January 15th and 16th we will hold the third midwinter meeting in discrete probability.