On the Ramsey numbers of fans and stars
Abstract
Let Fn be the graph on 2n+1 vertices consisting of n triangles meeting at a single vertex. After a number of improvements over the years, it is currently known that the Ramsey number of Fn is between 4.5n-5 (Chen, Yu, Zhao) and (5+16)n+O(1) (Dvor\'ak and Metrebian). We improve both of these bounds as follows 4.732n≈ (3+3)n-8< R(Fn)≤ (5+o(1))n. Additionally, as it relates to the lower bound on R(Fn) (and for which nothing was known when n< m< n(n-1)), we determine the Ramsey numbers of stars vs.~fans, within a constant, as follows R(K1,m, Fn)= cases m+2n-1+(-1)m2, & m≤ n 3m+m2+8n22+(1), & m>n cases. In particular, we have R(K1,2n, Fn)=(3+3)n+(1).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.