On the Ramsey number of the triangle and the cube (Q519971): Difference between revisions

The red/blue Ramsey number \(\mathrm r(Q_{n}, K_{s})\) is the minimal \(N\) such that, for every (red/blue)-coloring of edges of the complete graph \(K_{N}\), there exists either red cube \(Q_{n}\) (\(Q_{n}=K_{2} ^{n}\)) or blue \(K_{s}\). The authors prove that \(\mathrm r(Q_{n}, K_{3})= (1+o(n))2^{n}\) as \(n\rightarrow\infty\). The final result in this direction \((\mathrm r(Q_{n}, K_{s})=(s-1)(2_{n}-1)+1)\) was obtained by the same authors in [J. Lond. Math. Soc., II. Ser. 89, No. 3, 680--702 (2014; Zbl 1295.05253)].