Periodic Reporting for period 1 - MIDEHA (Minimum degree conditions for tight Hamilton cycles and spanning spheres)

Summary
The search for Hamilton cycles in graphs and hypergraphs has received much attention in combinatorial research over the past decades. Hamilton cycles in graphs play a fundamental role in many real world problems such as meshes in computer graphics, database theory, circuit...
More information & hyperlinks