Thesis supervisor: Béla Csaba
Location of studies (in Hungarian): SZTE Matematika- és Számítástudományok Doktori Iskola Abbreviation of location of studies: MatDI
Description of the research topic:
In a graph packing problem we are given two graphs, H and G, and our task is decide if H is a subgraph of G. This is among the central and very actively investigated questions of graph theory. Packing has lots of applications in combinatorics, geometry, computers science, and other areas of mathematics. The question formulated above is an NP-complete problem in many cases. Hence, in such caseswe look for sufficient conditions that guarantee the containment relation. This way we obtain problems in extremal graph theory. It is particularly important to find bounded degree spanning trees in dense or in random graphs, for which we have some structural assumption. The goal is to investigate and solve such problems, and if necessary, to develop new general methods as well.
Number of students who can be accepted: 1
Deadline for application: 2017-09-01
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).
Login
