Online Talk: Ruth Luo

YouTube recording:

Time: Thursday, Mar 30, 3pm ET

Speaker: Ruth Luo, University of South Carolina
Title: A hypergraph analog of Dirac’s Theorem for 2-connected graphs

Abstract: Every graph with minimum degree $k \geq 2$ contains a cycle of length at least $k+1.$ Dirac proved that if the graph is also 2-connected then in fact we can find a cycle of length at least $min\{2k, n\}$. We prove a hypergraph version of this theorem: a minimum degree condition that forces the existence of long Berge cycles in 2-connected, uniform hypergraphs. This is joint work with Alexandr Kostochka and Grace McCourt.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.