A Bound for Size Ramsey Numbers of Multi-partite Graphs
Abstract
It is shown that the (diagonal) size Ramsey numbers of complete $m$-partite graphs $K_{m}(n)$ can be bounded from below by $cn^22^{(m-1)n}$, where $c$ is a positive constant.
It is shown that the (diagonal) size Ramsey numbers of complete $m$-partite graphs $K_{m}(n)$ can be bounded from below by $cn^22^{(m-1)n}$, where $c$ is a positive constant.