Improved bounds on the Ramsey number of fans
Improved bounds on the Ramsey number of fans
复制标题
拉姆齐球迷数量的增加
DOI:
10.1016/j.ejc.2021.103347
复制
发表时间:
2020-06
影响因子:
1
通讯作者:
Yi Zhao
中科院分区:
文献类型:
--
作者:
Guantao Chen;Xiaowei Yu;Yi Zhao
For a given graph H, the Ramsey number r (H) is the minimum N such that any 2-edge-coloring of the complete graph K N yields a monochromatic copy of H. Given a positive integer n, a fan F n is a graph formed by n triangles that share one common vertex. We show that 9 n∕ 2− 5≤ r (F n)≤ 11 n∕ 2+ 6 for any n. This improves previous best bounds r (F n)≤ 6 n of Lin and Li and r (F n)≥ 4 n+ 2 of Zhang, Broersma and Chen.
登录
查看更多内容
影响因子:
0.8
作者:
P. Erdos;R. Faudree;C. Rousseau;R. Schelp
通讯作者:
P. Erdos;R. Faudree;C. Rousseau;R. Schelp
影响因子:
1.1
作者:
D. Conlon;J. Fox;Yuval Wigderson
通讯作者:
D. Conlon;J. Fox;Yuval Wigderson
DOI:
10.1002/(sici)1097-0118(199612)23:4
发表时间:
1996-12
期刊:
J. Graph Theory
影响因子:
--
作者:
Yusheng Li;C. Rousseau
通讯作者:
Yusheng Li;C. Rousseau
DOI:
10.1002/jgt.3190020110
发表时间:
1978-03
期刊:
J. Graph Theory
影响因子:
--
作者:
C. Rousseau;John T. Sheehan
通讯作者:
C. Rousseau;John T. Sheehan
影响因子:
9.9
作者:
D. Conlon;J. Fox;B. Sudakov
通讯作者:
D. Conlon;J. Fox;B. Sudakov