27
Sep
Title: Hamilton cycles and perfect matchings in hypergraphs
Speaker: Andrzej Rucinski (Adam Mickiewicz University, Poznan)
When: September 27, 16:30-17:30pm
Where: Wean Hall 5302
Abstract:
A classic theorem of Dirac states that a sufficient condition for an n-vertex graph to be hamiltonian is that the minimum degree is at least n/2. In my talk I will present recent results on Dirac type problems for k-uniform hypergraphs, obtained jointly with V.Rodl and E.Szemeredi.
