A bound for size Ramsey numbers of multipartite graphs (Q2372896)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5171585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bound for size Ramsey numbers of multipartite graphs |
scientific article; zbMATH DE number 5171585 |
Statements
A bound for size Ramsey numbers of multipartite graphs (English)
0 references
16 July 2007
0 references
Summary: 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.
0 references
0.9465327
0 references
0.94480383
0 references
0.9373908
0 references
0.93378407
0 references
0.9323595
0 references
0 references
0 references
0.9278493
0 references
0.92772055
0 references
