Thesis topic proposal
Ágnes Backhausz
Limits of hypergraphs and applications


Institute: Eötvös Loránd University, Budapest
mathematics and computing
Doctoral School of Mathematics

Thesis supervisor: Ágnes Backhausz
Location of studies (in Hungarian): Alfréd Rényi Institute of Mathematics
Abbreviation of location of studies: ELKH

Description of the research topic:

The theory of graph limits has been an actively studied field in the last decade. It combines various tools from combinatorics, probability theory and analysis, and leads to new results about random graphs or dynamic processes on graphs. However, the vertex-edge structure is not always sufficient to describe certain phenomena in modelling or formulating results in combinatorics. Hence it is worth studying how we can extend the different notions of graph limits to hypergraph sequences, what kind of limit objects can we find, and what are the consequences of this, for example about the structure of random hypergraphs or dynamic processes on hypergraphs. The goal is to study and develop possible limit theories for hypergraphs, and find various applications.

Required language skills: English
Further requirements: 
master's degree in mathematics

Number of students who can be accepted: 1

Deadline for application: 2023-05-31

All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 2.2358 ( 2017. X. 31. )