首页|Multicolor Ramsey Number of Stars Versus a Path
Multicolor Ramsey Number of Stars Versus a Path
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
For given simple graphs H1,H2,…,Hc,the multicolor Ramsey number R(H1,H2,...,Hc)is defined as the smallest positive integer n such that for an arbitrary edge-decomposition{Gi}ci=1 of the complete graph Kn,at least one Gi has a subgraph isomorphic to Hi.Let m,n1,n2,...,nc be positive integers and Σ=Σci=1(ni-1).Some bounds and exact values of R(K1,n1,...,K1,nc,Pm)have been obtained in literature.Wang(Graphs Combin.,2020)conjec-tured that if Σ(≠)0(mod m-1)and Σ+1 ≥(m-3)2,then R(K1,n1,...,K1,nc,Pm)=Σ+m-1.In this note,we give a new lower bound and some exact values of R(K1,n1,...,K1,nc,Pm)pro-vided m ≤ Σ,Σ ≡ k(mod m-1),and 2 ≤ k ≤ m-2.These results partially confirm Wang's conjecture.
Ramsey numberstarpath
Xuejun ZHANG、Xinmin HOU
展开 >
School of Data Science,University of Science and Technology of China,Anhui 230026,P.R.China
School of Mathematical Sciences,University of Science and Technology of China,Anhui 230026,P.R.China
CAS Key Laboratory of Wu Wen-Tsun Mathematics,University of Science and Technology of China,Anhui 230026,P.R.China
Hefei National Laboratory,University of Science and Technology of China,Anhui 230026,P.R.China
展开 >
National Natural Science Foundation of ChinaNational Key R and D Program of ChinaInnovation Program for Quantum Science and Technology
NETL
NSTL
万方数据
