Ramsey numbers of cubes versus cliques (Q519968)

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 a red cube \(Q_{n}\) (\(Q_{n}=K_{2} ^{n}\)) or a blue \(K_{s}\). The authors prove that, for any natural number \(s\geq 3\), there exists a constant \(c_{s}\) such that \(r(Q_{n}, K_{s})\leq c_{s} 2^{n}\). At the very end of the paper, the authors notice that the final result in this direction \((r(Q_{n}, K_{s})=(s-1)(2^{n}-1)+1)\) was obtained in [\textit{G. F. Pontiveros} et al., ibid. 36, No. 1, 71--89 (2016; Zbl 1374.05162); J. Lond. Math. Soc., II. Ser. 89, No. 3, 680--702 (2014; Zbl 1295.05253)].