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 $K_n$ denote the complete graph on $n$ vertices and $G, H$ be finitegraphs. Consider a two-coloring of edges of $K_n$. When a copy of $G$ in thefirst color, red, or a copy of $H$ in the second color, blue is in $K_n$, wewrite $K_n\rightarrow (G,H)$. The Ramsey number $r(G, H)$ is defined as thesmallest positive integer $n$ such that $K_{n} \rightarrow (G, H)$. Starcritical Ramsey $r_*(G, H)$ is defined as the largest value of $k$ such that$K_{r(G,H)-1} \sqcup K_{1,k} \rightarrow (G, H)$. In this paper, we find$r_*(C_n, K_m)$ for $m \geq 7$ and $n \geq (m-3)(m-1)$.

On Star critical Ramsey numbers related to large cycles versus complete graphs