English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Dirac proved that each $n$-vertex $2$-connected graph with minimum degree atleast $k$ contains a cycle of length at least $\min\{2k, n\}$. We consider ahypergraph version of this result. A Berge cycle in a hypergraph is analternating sequence of distinct vertices and edges $v_1,e_2,v_2, \ldots, e_c,v_1$ such that $\{v_i,v_{i+1}\} \subseteq e_i$ for all $i$ (with indices takenmodulo $c$). We prove that for $n \geq k \geq r+2 \geq 5$, every $2$-connected$r$-uniform $n$-vertex hypergraph with minimum degree at least ${k-1 \chooser-1} + 1$ has a Berge cycle of length at least $\min\{2k, n\}$. The bound isexact for all $k\geq r+2\geq 5$.

A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs