Ramsey numbers of loose triangles versus cliques
An $r$-uniform loose triangle $C_3$ consists of three edges that intersect pairwise in exactly one vertex and have no vertex common to all three. For graphs, this is the usual triangle, and the Ramsey number $R(C_3,K_t)$ has order of magnitude $t^2/\log t$ by celebrated results of Ajtai, Komlós, and Szemerédi and of Kim. Kostochka, Mubayi, and Verstraëte proved that $R(C_3,K_t^{(r)})=O_r(t^{3/2})$ for every fixed $r\ge3$ and showed that this bound is sharp up to a logarithmic factor. Motivated by the logarithmic saving in the graph case, they conjectured in 2013 that the upper bound could be improved to $o(t^{3/2})$.This conjecture has since received significant attention and has been reiterated in several papers. We prove the conjecture by showing that, for every fixed $r\ge3$, \[ R(C_3,K_t^{(r)}) =O_r\left(\frac{t^{3/2}}{\sqrt{\log\log t}}\right). \]
Authors
- Abhishek Methuku (ORCID: https://orcid.org/0000-0002-5244-5365)
- Abhishek Dhawan (ORCID: https://orcid.org/0000-0003-1971-7733)
- Ayush Basu
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.16957
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- preprint