Extremal and enumerative problems for discrete structures

Lead Research Organisation: University of Warwick
Department Name: Mathematics


This project will deal with extremal and enumerative problems for finite graphs, hypergraphs and other discrete structures, using a number of techniques
(analytic methods, probabilistic tools, the regularity approach, etc). It is hoped that a progress or a better understanding is attained on a number of questions relating global and local parameters (forbidden subgraphs, cycle structure, edge density, etc). Results of this type may be potentially of interest in theoretical computer science for the design of algorithms.


10 25 50

Studentship Projects

Project Reference Relationship Related To Start End Student Name
EP/T51794X/1 30/09/2020 29/09/2025
2435429 Studentship EP/T51794X/1 04/10/2020 31/03/2024 Irene Gil Fernández