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

The 3-uniform tight cycle $C_s^3$ has vertex set $ Z_s$ and edge set $\{\{i,i+1, i+2\}: i \in Z_s\}$. We prove that for every $s \not\equiv 0$ (mod 3) and$s \ge 16$ or $s \in \{8,11,14\}$ there is a $c_s>0$ such that the 3-uniformhypergraph Ramsey number $$r(C_s^3, K_n^3)< 2^{c_s n \log n}$$ This answers instrong form a question of the author and R\"odl who asked for an upper bound ofthe form $2^{n^{1+\epsilon_s}}$ for each fixed $s \ge 4$, where $\epsilon_s\rightarrow 0$ as $s \rightarrow \infty$ and $n$ is sufficiently large. Theresult is nearly tight as the lower bound is known to be exponential in $n$.

Improved bounds for the Ramsey number of tight cycles versus cliques