Ramsey numbers for complete graphs versus generalized fans
Combinatorics
2021-11-12 v1
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 .
Keywords
Cite
@article{arxiv.2111.06107,
title = {Ramsey numbers for complete graphs versus generalized fans},
author = {Maoqun Wang and Jianguo Qian},
journal= {arXiv preprint arXiv:2111.06107},
year = {2021}
}
Comments
9 pages