Affordable Access

Publisher Website

Improved bounds for the Ramsey number of tight cycles versus cliques

Authors
Type
Preprint
Publication Date
Submission Date
Identifiers
DOI: 10.1017/S0963548316000080
arXiv ID: 1511.09104
Source
arXiv
External links

Abstract

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-uniform hypergraph Ramsey number $$r(C_s^3, K_n^3)< 2^{c_s n \log n}$$ This answers in strong form a question of the author and R\"odl who asked for an upper bound of the 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. The result is nearly tight as the lower bound is known to be exponential in $n$.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments