A New Upper Bound for the Ramsey Number of Fans
Abstract
A fan Fn is a graph consisting of n triangles, all having precisely one common vertex. Currently, the best known bounds for the Ramsey number R(Fn) are 9n/2-5 ≤ R(Fn) ≤ 11n/2+6, obtained by Chen, Yu and Zhao. We improve the upper bound to 31n/6+O(1).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.