The Ramsey number for the pair of graphs K1,n (star) versus Wm (wheel) has been extensively studied. In contrast, the Ramsey number of K2,n
Nearby in the stack
versus the wheel is not yet explored due to the bit more structural complexity of
K2,n
compared to the star. In this article, we have established an exact value of
K2,n
versus
Wm
for large
n
and
m
. In particular, we have proved equation* R(K₂,n, W_m)=3n+4, equation* whenever
n
and
m
are sufficiently large integers satisfying
n≥4m
and
m
is an odd integer. This proves the
Wm
-goodness of
K2,n
. Our proof combines probabilistic methods with an analysis of structural dependencies. As part of the argument, we resolve a structural rigidity question concerning highly dependent neighbourhoods (Lemma 3.12).
arXiv did not return neighbours for this paper. Try again in a bit.