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

For given graphs G1 and G2 the Ramsey number R(G1,G2), is the smallestpositive integer n such that each blue-red edge coloring of the complete graphKn contains a blue copy of G1 or a red copy of G2. In 1983, Erdos conjecturedthat there is an absolute constant c such that R(G) = R(G,G) < 2c p m for anygraph G with m edges and no isolated vertices. Recently this conjecture wasproved by B. Sudakov. In this note, using the Sudakovs ideas we give anextension of his result and some interesting corollaries.

Around a conjecture of ErdH{o}s on graph Ramsey numbers