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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Let $r(G,H)$ be the smallest integer $N$ such that for any $2$-coloring (say,red and blue) of the edges of $K\_n$, $n\geqslant N$, there is either a redcopy of $G$ or a blue copy of $H$. Let $K\_n-K\_{1,s}$ be the complete graph on$n$ vertices from which the edges of $K\_{1,s}$ are dropped. In this note wepresent exact values for $r(K\_m-K\_{1,1},K\_n-K\_{1,s})$ and new upper boundsfor $r(K\_m,K\_n-K\_{1,s})$ in numerous cases. We also present some results forthe Ramsey number of Wheels versus $K\_n-K\_{1,s}$.

On Ramsey numbers of complete graphs with dropped stars