Answers are grounded in this paper and cite their sources.
Given two graphs G and H , the Ramsey number R(G,H) is the smallest positive integer N such that every 2-coloring of the edges of K_N contains either a red G or a blue H . Let K_N-1 K_1,k be the graph obtained from K_N-1 by adding a new vertex v connecting k vertices of K_N-1 . A graph G with χ(G)=k+1 is called edge-critical if G contains an edge e such that χ(G-e)=k . A considerable amount of research has been conducted by previous scholars on Ramsey numbers of graphs. In this paper, we show that for an edge-critical graph G with χ(G)=k+1 , when k 2 , t 2 , and n is sufficiently large, R(G, K_1+nK_t)=knt+1 and r_*(G,K_1+nK_t)=(k-1)nt+t .
No takes yet. Share an insight, caveat, or question.
Jiang et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: