Answers are grounded in this paper and cite their sources.
Let G be a graph with chromatic number χ and with t being the minimum number of points in any color class of any point-coloring of G with χ colors. Let H be any connected graph and let Hn be a graph on n points which is homeomorphic to H. It is proved that if n is large enough, the Ramsey number r(G, Hn) satisfies r(G, Hn) = (χ − l)(n −l) + t. It is also shown that for some G, no such result holds when Hn is a star with n points.
No takes yet. Share an insight, caveat, or question.
Stefan Burr (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: