ODT - THESIS TOPIC: János Barát: Edge-decompositions of graphs with ...


	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

Edge-decompositions of graphs with a condition on the edge-connectivity

THESIS TOPIC PROPOSAL

Institute: University of Szeged
mathematics and computing
Doctoral School of Mathematics

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