Minimum Pair-degree for Hamiltonian Cycles in 4-graphs

15 July 2020 s m

by Andrzej Ruciński

Abstract:

We show that every 4-uniform hypergraph with $n$ vertices and minimum pair degree at least $(5/9+o(1))n^2/2$ contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.

Joint work with J. Polcyn, Chr. Reiher, V. Rödl, M. Schacht, and B. Schülke.

get slides

Event Timeslots (1)

Wednesday
2:00 pm - 3:10 pm
Andrzej Ruciński