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

We consider the binomial random graph $G(n,p)$, where $p$ is a constant, andanswer the following two questions.  First, given $e(k)=p{k\choose 2}+O(k)$, what is the maximum $k$ such thata.a.s.~the binomial random graph $G(n,p)$ has an induced subgraph with $k$vertices and $e(k)$ edges? We prove that this maximum is not concentrated inany finite set (in contrast to the case of a small $e(k)$). Moreover, for everyconstant $C>0$ and every $\omega_n\to\infty$, a.a.s.~the size of theconcentration set belongs to $(C\sqrt{n/\ln n},\omega_n\sqrt{n/\ln n})$.  Second, given $k>\varepsilon n$, what is the maximum $\mu$ such thata.a.s.~the set of sizes of $k$-vertex subgraphs of $G(n,p)$ contains a fullinterval of length $\mu$? The answer is$\mu=\Theta\left(\sqrt{(n-k)n\ln{n\choose k}}\right)$.

On the sizes of large subgraphs of the binomial random graph