On characterizing the critical graphs for matching Ramsey numbers

Chuandong Xu, Hongna Yang, Shenggui Zhang

Given simple graphs $H_1,H_2,\dots ,H_c$, the Ramsey number $r(H_1,H_2,\dots ,H_c)$ is the smallest positive integer $n$ such that every edge-colored $K_n$ with $c$ c…