Extremal and enumerative problems for discrete structures

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.