New upper and lower bounds for Ramsey numbers (Q1840836)
From MaRDI portal
!
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 1567140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New upper and lower bounds for Ramsey numbers |
scientific article; zbMATH DE number 1567140 |
Statements
New upper and lower bounds for Ramsey numbers (English)
0 references
30 October 2001
0 references
The Ramsey number \(R(G_1, G_2)\) is the smallest integer \(p\) such that for any graph \(G\) on \(p\) vertices either \(G\) contains the graph \(G_1\) or the complement \(\overline G\) of \(G\) contains the graph \(G_2\). The paper presents some new upper and lower bound formulas for \(R(G_1,G_2)\) and \(R(K_m, K_n)\).
0 references
Ramsey graph
0 references
Ramsey number
0 references
bound formulas
0 references
0.9050034284591676
0 references
0.8745156526565552
0 references
0.8590562343597412
0 references
