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. We improve the upper bound to 31n/6+O(1).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
