A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Ramsey number of fans
[article]
2020
arXiv
pre-print
For a given graph H, the Ramsey number r(H) is the minimum N such that any 2-edge-coloring of the complete graph K_N yields a monochromatic copy of H. Given a positive integer n, let nK_3, F_n and B_n be three graphs formed by n triangles that share zero, one, and two common vertices, respectively. Burr, Erdős and Spencer in 1975 showed that r(nK_3) = 5n for n > 2. Rousseau and Sheehan in 1978 showed that r(B_n)< 4n + 2 and equality holds for infinitely many values of n. We believe that r(B_n)<
arXiv:2007.00152v1
fatcat:mnipdfx3zrbhtnrg35lb3yante