ODT - THESIS TOPIC: Béla Csaba: Graph embedding 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

Graph embedding problems

THESIS TOPIC PROPOSAL

Institute: University of Szeged
mathematics and computing
Mathematics Doctoral School

Thesis supervisor: Béla Csaba
Location of studies (in Hungarian): University of Szeged, Faculty of Science and Informatics, Bolyai Institute
Abbreviation of location of studies: MatDI

Description of the research topic:

What conditions guarantee that a graph H is a spanning or
almost spanning subgraph of another graph G? Special focus
is on developing and applying new techniques that
allows to avoid the use of the Regularity lemma.

Required language skills: English
Further requirements:
Stipendium Hungaricum

Number of students who can be accepted: 1

Deadline for application: 2019-09-15

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).