Thesis supervisor: Dániel Gerbner
Location of studies (in Hungarian): Rényi Institute Abbreviation of location of studies: BME
Description of the research topic:
In ordinary Turán problems, the basic question is the largest number of edges in graphs on n vertices, avoiding a fixed subgraph. In generalized Turán problems, we look for the largest number of copies of another fixed subgraph instead. After several sporadic results, the sytematic study of these problems was initiated by Alon and Shikhelman. Their paper was on arXiv in 2014 and published in 2016, yet it already has 180 citations on google scholar. Despite this extensive research, several basic problems have not even been studied.
Required language skills: English Further requirements: Basic knowledge of graph theory