## Project Details

### Description

Graphs are mathematical models of networks occurring in the sciences, economics or informatics. Frequently the evolution of networks can be modelled probabilistically, which motivates the study of random graphs. Also it has emerged that random graphs are extremely rich and useful mathematical objects with numerous applications in other areas of mathematics such as information theory or Ramsey theory. The systematic study of random graphs started in the 1960s with the work of the Hungarian mathematicians Paul Erdos and Alfred Renyi. Yet to this day many important properties of random graphs remain poorly understood. The aim of this collaborative project, which is hosted jointly at Goethe University Frankfurt in Germany and at TU Graz in Austria, is to advance the rigorous mathematical understanding of random graphs with the assistance of novel mathematical tools originating, for example, from enumerative combinatorics or the recent theory of graph limits. Specific problems that we intend to study include the graph colouring problem on random graphs, strongly connected sub-structures of random graphs called cores and the contagion of cascading events. For example, graph colouring has been a core topic of mathematics since the famous four colour problem posed by Gutherie in 1852. Cores have applications, for example, in coding theory, and contagion is a key topic in the study of complex social or artificial networks.

Status | Active |
---|---|

Effective start/end date | 1/09/18 → 30/06/22 |