Vojtěch Dvořák, Harry Metrebian
Published 2021-09-16Version 1
A fan $F_n$ is a graph consisting of $n$ triangles, all having precisely one common vertex. Currently, the best known bounds for the Ramsey number $R(F_n)$ are $9n/2-5 \leq R(F_n) \leq 11n/2+6$, obtained by Chen, Yu and Zhao. We improve the upper bound to $31n/6+O(1)$.
The Ramsey numbers of paths versus wheels: a complete solution
On Ramsey numbers of 3-uniform Berge cycles
The Ramsey number of a long even cycle versus a star
![QR code for arXiv:2109.07935 [math.CO]](http://oss.arxitics.com/images/favicon.svg)