For n large, every n-vertex r-uniform hypergraph with r at least about n/2 and minimum degree above the sharp Dirac threshold contains Berge cycles of every length from 2 to n.
Sufficient conditions for graphs to contain all subgr aphs of a given type
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Pancyclicity in hypergraphs with large uniformity
For n large, every n-vertex r-uniform hypergraph with r at least about n/2 and minimum degree above the sharp Dirac threshold contains Berge cycles of every length from 2 to n.