ERC Starting Grant · 2020
Graph Theory is a highly active area of Combinatorics with strong links to fields such as Optimisation and Theoretical Computer Science. A fundamental meta-problem in Graph Theory is the following: given a graph H, what conditions guarantee that another graph G contains a copy of H as a subgraph? This is particularly important when H is spanning, i.e. where G and H have the same number of vertices. This project will address a range of exciting and challenging extremal and probabilistic problems on spanning subgraphs in graphs, in the following two interrelated areas: 1. Spanning subgraphs in random graphs: A key aim of Probabilistic Combinatorics is to determine the density threshold for…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.