Thesis supervisor: János Barát
Location of studies (in Hungarian): Bolyai Institute, Faculty of Science and Informatics, University of Szeged, Hungary Abbreviation of location of studies: MatDI
Description of the research topic:
Let G be a 3-edge-connected graph. We would like to partition the edge set into parts (as few as possible) such that the removal of any part leaves a 2-edge-connected subgraph. It can be shown that 9 parts are sufficient, and there are graphs, where 4 parts are necessary. The problem is interesting for other odd connectivities. Moreover, a similar notion called Frank number is studied for 3-edge-connected graphs. Here there is a possibility to generalise to other odd integers.
Required language skills: English Further requirements: Stipendium Hungaricum
Number of students who can be accepted: 1
Deadline for application: 2024-12-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).
Login
