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/

Zendy Plus

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

Zendy Tools

Zendy Open

If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$to say that every orientation of the edges of $G$ contains $\vec H$ as asubdigraph. We consider the case in which $G=G(n,p)$, the binomial randomgraph. We determine the threshold $p_{\vec H}=p_{\vec H}(n)$ for the property$G(n,p)\to \vec H$ for the cases in which $\vec H$ is an acyclic orientation ofa complete graph or of a cycle.

Orientation Ramsey thresholds for cycles and cliques