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

For given graphs $F$ and $G$, the minimum number of edges in aninclusion-maximal $F$-free subgraph of $G$ is called the $F$-saturation numberand denoted $\mathrm{sat}(G, F)$. For the star $F=K_{1,r}$, the asymptotics of$\mathrm{sat}(G(n,p),F)$ is known. We prove a sharper result: whp$\mathrm{sat}(G(n,p), K_{1,r})$ is concentrated in a set of 2 consecutivepoints.

Tight concentration of star saturation number in random graphs