Printable PDF
Department of Mathematics,
Department of Mathematics,
University of California San Diego
****************************
Math 269 - Combinatorics Seminar
Ruth Luo
UCSD
A Dirac Theorem for hamiltonian hypergraphs
Abstract:
Dirac proved that every $n$-vertex graph with minimum degree at least $n/2$ contains a hamiltonian cycle. We prove an analogue for hypergraphs: we give exact bounds for the minimum degree of a uniform hypergraph that implies the existence of hamiltonian Berge cycles. \\ \\ This is joint work with Alexandr Kostochka and Grace McCourt.
Host: Professor Jacques Verstraete
September 28, 2021
4:00 PM
APM 6402 (Halkin Room)
****************************
