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 graph $G$ the symbol $G\tov(a_1,...,a_r)$ means that in every$r$-coloring of the vertices of $G$ for some $i\in\{1,...,r\}$ there exists amonochromatic $a_i$-clique of color $i$. The vertex Folkman numbers \[\FN=\min\{|V(G)|:G\tov(a_1,...,a_r)\text{and}K_q\nsubseteqq G\} \] areconsidered. In this paper we shall compute the Folkman numbers$F_v(\underbrace{2,...,2}_r;r-k+1)$ when $k\le 12$ and $r$ is sufficientlylarge. We prove also new bounds for some vertex and edge Folkman numbers.

On the Vertex Folkman Numbers $F_v(2,...,2;q)$