ERC Consolidator Grant · 2016
Problems in Extremal and Probabilistic Combinatorics
Extremal and probabilistic combinatorics is a central and currently maybe the most active and fastest growing area in discrete mathematics. The field can be traced back to the work of Turán and it was established by Erdős through his fundamental contributions and his uncounted guiding questions. Since then it has grown into an important discipline with strong ties to other mathematical areas such as theoretical computer science, number theory, and ergodic theory. The PI proposes a variety of extremal problems for hypergraphs and for sparse random and pseudorandom graphs. The work for hypergraphs is motivated by Turán’s problem, maybe the most prominent open problem in the area. After…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.