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 present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analytic limit version of the problem. We show that, for example, it applies to the inducibility problem for an arbitrary complete bipartite graph    B  $B$   , which asks for the maximum number of induced copies of    B  $B$    in an    n  $n$   ‐vertex graph, and to the inducibility problem forK   2  ,  1  ,  1  ,  1    $K_{2,1,1,1}$    andK   3  ,  1  ,  1    $K_{3,1,1}$   , the only complete partite graphs on at most five vertices for which the problem was previously open.

Stability from graph symmetrisation arguments with applications to inducibility