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

Let $P(n,m)$ be a graph chosen uniformly at random from the class of allplanar graphs on vertex set $\left\{1, \ldots, n\right\}$ with $m=m(n)$ edges.We show that in the sparse regime, when $\limsup_{n \to \infty} m/n<1$, withhigh probability the maximum degree of $P(n,m)$ takes at most two differentvalues.

Two point concentration of maximum degree in sparse random planar graphs