The logarithmic exponent of the Ramsey number $r(4,t)$
We prove that $r(4,t) \ge \frac{t^3}{(\log t)^{2+o(1)}}$. This improves the lower bound of Mattheus and Verstra\"ete (Ann. of Math., 2024) by a factor of $(\log t)^{2-o(1)}$.
AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
We prove that $r(4,t) \ge \frac{t^3}{(\log t)^{2+o(1)}}$. This improves the lower bound of Mattheus and Verstra\"ete (Ann. of Math., 2024) by a factor of $(\log t)^{2-o(1)}$.
The \emph{ordered Ramsey number} $r_<(G,H)$ of ordered $k$-graphs $G$ and $H$ is the least integer $N$ such that every red-blue edge-coloring of the naturally ordered complete $k$-graph on $[N]$ contains a blue ordered copy of $G$ or a red ordered copy of $H$. We prove that there is an absolute constant $c>0$ such that...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.