CORDIS Project
Funding breakdown and partner intelligence are Premium
Sign in and upgrade to Premium for EU contribution totals, consortium analytics, OpenAlex research context, and AI summaries. · 0 consortium intelligence fields visible of 1
Start free • Cancel anytime • 14-day refund guarantee
This project investigates Hamilton cycles in graphs and hypergraphs, focusing on generalizations such as tight cycles and spheres. It aims to establish optimal minimum degree conditions using innovative techniques in hypergraph regularity and combinatorial optimization, with potential applications in various fields.
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 opti…
UNIVERSITY OF HAMBURG
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 EuroSciVoc fields.
Guests see up to 5 topics.
Guests see up to 5 keywords.
