« A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-connected Graphs
A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-connected Graphs
April 19, 2023, 12:15 PM - 1:15 PM
Location:
Online Event
Grace McCourt, University of Illinois, Urbana-Champaign
Dirac proved that each n-vertex 2-connected graph with minimum degree at least k contains a cycle of length at least min{2k, n}. We prove a hypergraph version of this result: for n geq k geq r+2 geq 5, every 2-connected r-uniform n-vertex hypergraph with minimum degree at least {k-1 choose r-1}+1 has a Berge cycle of length at least min{2k, n}. The bound is exact for all k geq r+2 geq 5. This work is joint with Alexandr Kostochka and Ruth Luo.
Presented on zoom: https://rutgers.zoom.us/j/93717937010?pwd=Z2RyY01HKzVhVFlXRXR1anluRFIvQT09
Meeting ID: 937 1793 7010
Password: gcs2023