Ramsey numbers for complete graphs versus generalized fans
Maoqun Wang, Jianguo Qian

TL;DR
This paper determines new exact values and bounds for Ramsey numbers involving complete graphs and generalized fan graphs, extending previous results to broader cases with large parameters.
Contribution
The paper generalizes known Ramsey number results to complete graphs versus multiple generalized fans, providing explicit formulas and bounds for large parameters.
Findings
Exact Ramsey number for K_m versus sF_{t,n} for large n
Exact Ramsey number for K_3 versus F_{3,n} and F_{4,n}
Upper bounds on Ramsey numbers involving generalized fans
Abstract
For two graphs and , let and denote the Ramsey number and star-critical Ramsey number of versus , respectively. In 1996, Li and Rousseau proved that for and sufficiently large , where . Recently, Hao and Lin proved that for and for . In this paper, we show that for sufficiently large and, in particular, for and . We also show that for and establish an upper bound on .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Advanced Topology and Set Theory
