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

In 2006, K\"{u}hn and Osthus showed that if a 3-graph H on n vertices hasminimum co-degree at least (1/4 +o(1))n and n is even then H has a looseHamilton cycle. In this paper, we prove that the minimum co-degree of n/4suffices. The result is tight.

Tight co-degree condition for the existence of loose Hamilton cycles in 3-graphs