A note on the Ramsey number of K2,2K2,2 versus K3,nK3,n

Considering a known upper bound, the exact value of the Ramsey number r(K2,2,K3,n)r(K2,2,K3,n) is determined for some small n  , namely 3⩽n⩽103⩽n⩽10. For three of these numbers the research is assisted by a computer. Moreover, our results prove that the above mentioned upper bound is best possible in any of its cases.