2016
Dec
12

# Combinatorics: Zur Luria (ETH)

11:00am to 1:00pm

## Location:

B220 Rothberg (CS)

Speaker: Zur Luria (ETH)
Title: Hamiltonian spheres in random hypergraphs
Abstract:
Hamiltonian cycles are a fundamental object in graph theory, and combinatorics in general. A classical result states that in the random graph model G(n,p), there is a sharp threshold for the appearance of a Hamiltonian cycle. It is natural to wonder what happens in higher dimensions - that is, in random uniform hypergraphs?