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

An $r$-uniform hypergraphic sequence (i.e., $r$-graphic sequence) $d=(d_1,d_2,\cdots,d_n)$ is said to be forcibly $k$-edge-connected if every realizationof $d$ is $k$-edge-connected. In this paper, we obtain a strongest sufficientdegree condition for $d$ to be $k$-edge-connected for all $k\ge 1$ and astrongest sufficient degree condition for $d$ to be super edge-connected. As acorollary, we give the minimum degree condition for $d$ to be maximallyedge-connected. We also obtain another sufficient degree condition for $d$ tobe $k$-edge-connected.

New sufficient degree conditions for an $r$-uniform hypergraph to be $k$-edge-connected