Multicolor Ramsey numbers on stars versus pat
Xuejun Zhang, Xinmin Hou

TL;DR
This paper investigates multicolor Ramsey numbers involving stars and paths, providing new bounds and exact values that support Wang's conjecture under specific conditions.
Contribution
The authors establish new lower bounds and exact values for multicolor Ramsey numbers involving stars and paths, partially confirming Wang's conjecture.
Findings
New lower bounds for R(K_{1,n_1},...,K_{1,n_c},P_m)
Exact values obtained when m ≤ Σ and certain modular conditions
Results support Wang's conjecture in specific cases
Abstract
For given simple graphs , the multicolor Ramsey number is defined as the smallest positive integer such that for an arbitrary edge-decomposition of the complete graph , at least one has a subgraph isomorphic to . Let be positive integers and . Some bounds and exact values of have been obtained in literature. Wang (Graphs Combin., 2020) conjectured that if and , then In this note, we give a new lower bound and some exact values of when , , and . These results partially confirm Wang's conjecture.
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
