A Bound for Size Ramsey Numbers of Multi-partite Graphs

It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn22(m−1)n, where c is a positive constant. Key words: Size Ramsey number, Complete multi-partite graph

• Type: Journal
• Year: 2007
• Where: COMBINATORICS
• Authors: Yuqin Sun, Yusheng Li
• Keywords: COMBINATORICS 2007, Complete M-partite Graphs, Ramsey Number, Size Ramsey Numbers