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

In this note it is proved that if a graph $G$ of order $n$ has an irreducible covering of its vertex set by $n-k$ cliques, then its clique number $\omega (G)\leq k+1$ if $k=2$ or 3 and $\omega (G)\leq { {k} \choose {\lfloor k/2\rfloor }}$ if $k\geq 4$. These bounds are sharp if $n\geq k+1$ (for $k=2$ or 3) and $n\geq k+ { {k} \choose {\lfloor k/2\rfloor }}$ (for $k\geq 4$).

Irreducible Coverings by Cliques and Sperner's Theorem