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

A permutation in a digraph $G=(V, E)$ is a bijection $f:V \rightarrow V$ suchthat for all $v \in V$ we either have that $f$ fixes $v$ or $(v, f(v)) \in E$.A derangement in $G$ is a permutation that does not fix any vertex. In [1] itis proved that in any digraph, the ratio of derangements to permutations is atmost $1/2$. Answering a question posed in [1], we show that the set of possibleratios of derangements to permutations in digraphs is dense in the interval$[0, 1/2]$.

The set of ratios of derangements to permutations in digraphs is dense in $[0, 1/2]$