Skip to main content
Aller à la page d’accueil de la Commission européenne (s’ouvre dans une nouvelle fenêtre)
français fr
CORDIS - Résultats de la recherche de l’UE
CORDIS

Minimum degree conditions for tight Hamilton cycles and spanning spheres

Objectif

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.

Champ scientifique (EuroSciVoc)

Mots‑clés

Programme(s)

Thème(s)

Régime de financement

MSCA-IF - Marie Skłodowska-Curie Individual Fellowships (IF)

Voir tous les projets financés dans le cadre de ce programme de financement

Appel à propositions

(s’ouvre dans une nouvelle fenêtre) H2020-MSCA-IF-2020

Voir tous les projets financés au titre de cet appel

Coordinateur

UNIVERSITY OF HAMBURG
Contribution nette de l'UE
€ 174 806,40
Coût total
€ 174 806,40