Berge pancyclic hypergraphs

Authors

• Ruth Luo, University of South Carolina

Document Type

Lecture

Publication Date

4-30-2025

Abstract

A Berge cycle of length k in a hypergraph H is a set of k distinct vertices v1, . . . , vk and k distinct edges e1, . . . , ek such that vi, vi+1 ∈ ei for all i (here indices are taken modulo k). We say an n-vertex hypergraph is pancyclic if it contains Berge cycles of every length from 2 to n. In this talk, we present sharp minimum degree bounds guaranteeing pancyclicity in an n-vertex, r-uniform hypergraph. This is joint work with Teegan Bailey, Isaiah Hollars, and Yupei Li.

Relational Format

presentation

Recommended Citation

Luo, Ruth, "Berge pancyclic hypergraphs" (2025). Combinatorics Seminar. 123.
https://egrove.olemiss.edu/math_combinatorics/123