Hamiltonian cycles in hypergraphs

Combinatorics Seminar
Event time: 
Thursday, September 13, 2018 - 4:00pm
DL 431
Mathias Schacht
Speaker affiliation: 
Yale University
Event description: 

We show that every 3-uniform hypergraph with every vertex being contained in at least 5/9+o(1) proportion of all possible edges contains a (tight) Hamiltonian cycle. Several different lower bound constructions show that this degree condition is asymptotically optimal.

Research Area(s):