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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study the asymptotic behavior of the clique number in rank-1 inhomogeneousrandom graphs, where edge probabilities between vertices are roughlyproportional to the product of their vertex weights. We show that the cliquenumber is concentrated on at most two consecutive integers, for which weprovide an expression. Interestingly, the order of the clique number isprimarily determined by the overall edge density, with the inhomogeneity onlyaffecting multiplicative constants or adding at most a $\log\log(n)$multiplicative factor. For sparse enough graphs the clique number is alwaysbounded and the effect of inhomogeneity completely vanishes.

Cliques in rank-1 random graphs: the role of inhomogeneity