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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The following relaxation of the classical problem of determining Ramseynumber of a fixed graph has first been proposed by Erdos, Hajnal and Rado over50 years ago. Given a graph $G$ and an integer $t \geq 2$ determine the minimumnumber $N$ such that in any $t$-coloured complete graph on $N$ vertices thereis a copy of $G$ using only edges of some $t-1$ colours. We determine theanswer precisely when $G$ is a path.

The (t-1)-chromatic Ramsey number for paths