Improved bounds for the Ramsey number of tight cycles versus cliques

preprint2016arXivOpen access

Abstract

The 3-uniform tight cycle Cs3C_s^3 has vertex set Zs Z_s and edge set {{i,i+1,i+2}:i∈Zs}\{\{i, i+1, i+2\}: i \in Z_s\}. We prove that for every s≢0s \not\equiv 0 (mod 3) and s≥16s \ge 16 or s∈{8,11,14}s \in \{8,11,14\} there is a cs>0c_s>0 such that the 3-uniform hypergraph Ramsey number r(Cs3,Kn3)<2csnlog⁡nr(C_s^3, K_n^3)< 2^{c_s n \log n} This answers in strong form a question of the author and Rödl who asked for an upper bound of the form 2n1+εs2^{n^{1+ε_s}} for each fixed s≥4s \ge 4, where εs→0ε_s \rightarrow 0 as s→∞s \rightarrow \infty and nn is sufficiently large. The result is nearly tight as the lower bound is known to be exponential in nn.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.