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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Given a function f a subset of its domain is a rainbow subset for f if f is one to one on it. We start with an old Erd˝os Problem: Assume f is a coloring of the pairs of !1 with three colors such that every subset A of !1 of size !1 contains a pair of each color. Does there exist a rainbow triangle ? We investigate rainbow problems and results of this style for colorings of pairs establishing negative "square bracket" relations.

Rainbow Ramsey theorems for colorings establishing negative partition relations