A Bound for Size Ramsey Numbers of Multi-partite Graphs

13 years 10 months ago

Download www3.combinatorics.org

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

Yuqin Sun, Yusheng Li

Real-time Traffic

COMBINATORICS 2007 | Complete M-partite Graphs | Ramsey Number | Size Ramsey Numbers |

claim paper

» RamseyType Results for Unions of Comparability Graphs

» Sharp thresholds for hypergraph regressive Ramsey numbers

» On generalized Ramsey numbers

» Bipartite Ramsey numbers and Zarankiewicz numbers

» Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs

» Monomulti bipartite Ramsey numbers designs and matrices

» Pathkipas Ramsey numbers

» Online Ramsey games for triangles in random graphs

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COMBINATORICS
Authors	Yuqin Sun, Yusheng Li

Comments (0)

Sciweavers

A Bound for Size Ramsey Numbers of Multi-partite Graphs

COMBINATORICS 2007 | Complete M-partite Graphs | Ramsey Number | Size Ramsey Numbers |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers