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

For a fixed graph $F$, a graph $G$ is said to be $F$-saturated if $G$ doesnot contain a subgraph isomorphic to $F$ but does contain $F$ after theaddition of any new edge.  Let $M_k$ be a matching consisting of $k$ edges and $S_{n,k}$ be the joingraph of a complete graph $K_k$ and an empty graph $\overline{K_{n-k}}$. Inthis paper, we prove that for $s \geq3$ and $k\geq 2$, $S_{n,s-2}$ contains theminimum number of $M_k$ among all $n$-vertex $K_s$-saturated graphs forsufficiently large $n$, and when $k \leq s-2$, it is the unique extremal graph.In addition, we also show that $S_{n,1}$ is the unique extremal graph when$k=2$ and $s=3$.

Minimizing the number of matchings of fixed size in a $K_s$-saturated graph