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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $\Delta_s=R(K_3,K_s)-R(K_3,K_{s-1})$, where $R(G,H)$ is the Ramsey numberof graphs $G$ and $H$ defined as the smallest $n$ such that any edge coloringof $K_n$ with two colors contains $G$ in the first color or $H$ in the secondcolor. In 1980, Erd\H{o}s and S\'{o}s posed some questions about the growth of$\Delta_s$. The best known concrete bounds on $\Delta_s$ are $3 \le \Delta_s\le s$, and they have not improved since the stating of the problem. In thispaper we present some constructions, which imply in particular that $R(K_3,K_s)\ge R(K_3,K_{s-1}-e) + 4$. This does not improve the lower bound of 3 on$\Delta_s$, but we still consider it a step towards to understanding itsgrowth. We discuss some related questions and state two conjectures involving$\Delta_s$, including the following: for some constant $d$ and all $s$ it holdsthat $\Delta_s - \Delta_{s+1} \leq d$. We also prove that if the latter istrue, then $\lim_{s \rightarrow \infty} \Delta_s/s=0$.

A step forwards on the Erd\H{o}s-S\'os problem concerning the Ramsey numbers $R(3,k)$