Given graphs $F$ and $H$, the induced Ramsey number $r_{\mathrm{ind}}(F,H)$ is the smallest integer $n$ for which there exists a graph $G$ on $n$ vertices such that every red-blue colouring of $E(G)$ contains either a blue induced copy of $F$ or a red induced copy of $H$. A conjecture of Kohayakawa, Pr\"omel and R\"odl...
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.· 0 citations
In this paper we determine the Ramsey number $R(3,3,k)$ up to a constant factor, showing that $$R(3,3,k) = \Theta\bigg( \frac{k^3}{(\log k)^2} \bigg).$$ The proof of the lower bound combines the Hefty-Horn-King-Pfender construction for $R(3,k)$ with the method of Alon and R\"odl. Using the same proof, we also determine...
Bruno Andrades, Marcelo Campos, Robert Morris· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.