ODT - THESIS TOPIC: Dániel Gerbner: Generalized Turán problems


	Login Forum Organisation officers member institutions resolutions (in Hung.) by-laws (in Hung.) regulations Doctoral program doctoral schools by institution by research field by number ceased working academic staff member by name by research topic archives thesis topic proposals by doctoral school by research field by research topic supervision of PhD students search students Theses defended by institution by research field by name by date by doctoral school Naturalized degrees by institution by research field by name by date Habilitation presentations by institution by branch of science by name Documents (all in Hung.) public documents news legal backgrounds guidelines Contacts contact details partners

Thesis topic proposal

Generalized Turán problems

THESIS TOPIC PROPOSAL

Institute: Budapest University of Technology and Economics
mathematics and computing
Doctoral School of Mathematics and Computer Sciences

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

Number of students who can be accepted: 1

Deadline for application: 2024-05-31

2024. IV. 17.
ODT ülés
Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).