A Bound for Size Ramsey Numbers of Multi-partite Graphs

  • Yuqin Sun
  • Yusheng Li
DOI: https://doi.org/10.37236/1012

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.

Published
2007-06-14
How to Cite
Sun, Y., & Li, Y. (2007). A Bound for Size Ramsey Numbers of Multi-partite Graphs. The Electronic Journal of Combinatorics, 14(1), N11. https://doi.org/10.37236/1012
Issue
Volume 14 (2007)
Article Number
N11