Summary
One of the most exciting developments in the second half of the last century in combinatorial research has been the search for Hamilton cycles in graphs and hypergraphs. Since the decision problem, whether a given graph contains a Hamilton cycle, is computationally intractable, no `simple' characterization for their existence is known. The main approach to finding Hamilton cycles has thus focused on natural sufficient conditions. A classic example for this is Dirac's theorem, which provides optimal minimum degree conditions for the existence of a Hamilton cycle in graphs.
The aim of this project is to resolve several problems regarding hypergraph analogues of Dirac's theorem. The proposed research considers two natural generalization of cycles: (i) Tight cycles, which have been extensively researched in the past two decades, and (ii) Spheres, a topological generalization of cycles, which was suggested by Brown, Erdős and Sós in the Seventies and has recently resurfaced in extremal graph theory. To determine optimal minimum degree conditions for spanning tight cycles and spheres, the experienced researcher plans to develop new techniques based on hypergraph regularity and combinatorial optimization, which will likely find application beyond the proposed research.
The aim of this project is to resolve several problems regarding hypergraph analogues of Dirac's theorem. The proposed research considers two natural generalization of cycles: (i) Tight cycles, which have been extensively researched in the past two decades, and (ii) Spheres, a topological generalization of cycles, which was suggested by Brown, Erdős and Sós in the Seventies and has recently resurfaced in extremal graph theory. To determine optimal minimum degree conditions for spanning tight cycles and spheres, the experienced researcher plans to develop new techniques based on hypergraph regularity and combinatorial optimization, which will likely find application beyond the proposed research.
Unfold all
/
Fold all
More information & hyperlinks
| Web resources: | https://cordis.europa.eu/project/id/101018431 |
| Start date: | 01-09-2022 |
| End date: | 31-08-2024 |
| Total budget - Public funding: | 174 806,40 Euro - 174 806,00 Euro |
Cordis data
Original description
One of the most exciting developments in the second half of the last century in combinatorial research has been the search for Hamilton cycles in graphs and hypergraphs. Since the decision problem, whether a given graph contains a Hamilton cycle, is computationally intractable, no `simple' characterization for their existence is known. The main approach to finding Hamilton cycles has thus focused on natural sufficient conditions. A classic example for this is Dirac's theorem, which provides optimal minimum degree conditions for the existence of a Hamilton cycle in graphs.The aim of this project is to resolve several problems regarding hypergraph analogues of Dirac's theorem. The proposed research considers two natural generalization of cycles: (i) Tight cycles, which have been extensively researched in the past two decades, and (ii) Spheres, a topological generalization of cycles, which was suggested by Brown, Erdős and Sós in the Seventies and has recently resurfaced in extremal graph theory. To determine optimal minimum degree conditions for spanning tight cycles and spheres, the experienced researcher plans to develop new techniques based on hypergraph regularity and combinatorial optimization, which will likely find application beyond the proposed research.
Status
SIGNEDCall topic
MSCA-IF-2020Update Date
28-04-2024
Images
No images available.
Geographical location(s)
Structured mapping
