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 celebrated Frieze's result about the independence number of $G(n,p)$states that it is concentrated in an interval of size $o(1/p)$ for all$C_{\varepsilon}/n<p=o(1)$. We show concentration in an interval of size$o(1/p)$ for the maximum size (number of vertices) of an induced forest in$G(n,p)$ for all $C_{\varepsilon}/n<p<1-\varepsilon$. Presumably, it is thefirst generalization of Frieze's result to another class of induced subgraphsfor such a range of $p$.

The maximum size of an induced forest in the binomial random graph