An upper bound on the ramsey number <i>R</i>(<i>K</i><sub>3</sub>, <i>G</i>) depending only on the size of the graph <i>G</i> (Q5202213)
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 4193723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the ramsey number <i>R</i>(<i>K</i><sub>3</sub>, <i>G</i>) depending only on the size of the graph <i>G</i> |
scientific article; zbMATH DE number 4193723 |
Statements
An upper bound on the ramsey number <i>R</i>(<i>K</i><sub>3</sub>, <i>G</i>) depending only on the size of the graph <i>G</i> (English)
0 references
1991
0 references
Ramsey number
0 references
0 references
0.9120707
0 references
0.9067678
0 references
0.9067547
0 references
0.90569603
0 references
0.9047703
0 references
0.8957948
0 references
0.89346063
0 references
