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

Let $G$ be a graph and $a_1, ..., a_s$ be positive integers. Then $G\overset{v}{\rightarrow} (a_1, ..., a_s)$ means that for every coloring of thevertices of $G$ in $s$ colors there exists $i \in \{1, ..., s\}$, such thatthere is a monochromatic $a_i$-clique of color $i$. The vertex Folkman number$F_v(a_1, ..., a_s; q)$ is defined by the equality: $$ F_v(a_1, ..., a_s; q) =\min\{|V(G)| : G \overset{v}{\rightarrow} (a_1, ..., a_s) \mbox{ and } K_q\not\subseteq G\}. $$ Let $m = \sum\limits_{i=1}^s (a_i - 1) + 1$. It is easyto see that $F_v(a_1, ..., a_s; q) = m$ if $q \geq m + 1$. In [11] it is provedthat $F_v(a_1, ..., a_s; m) = m + \max\{a_1, ..., a_s\}$. We know all thenumbers $F_v(a_1, ..., a_s; m - 1)$ when $\max\{a_1, ..., a_s\} \leq 5$ andnone of these numbers is known if $\max\{a_1, ..., a_s\} \geq 6$. In this paperwe compute the numbers $F_v(a_1, ..., a_s; m - 1)$ when $\max\{a_1, ..., a_s\}= 6$.

On the vertex Folkman numbers $F_v(a_1, ..., a_s; m - 1)$ when $\max\{a_1, ..., a_s\} = 6$ or $7$