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

Denote by k_4(n) the minimal number of monochromatic copies of a K_4 in a2-colouring of the edges of K_n and let c_4 := lim k_4(n)/\binom{n}{4}. Thebest known bounds so far were given by Thomason, who proved that c_4 < 1/33\approx 0.0303, and Giraud, who showed that c_4 > 1/46 \approx 0.0217. In thispaper we prove the new lower bound c_4 > 204603019 / 7112448000 > 0.0287.

Counting monochromatic copies of K_4: a new lower bound for the Ramsey multiplicity problem