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): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190150104 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979276699 / rank | |||
Normal rank | |||
Latest revision as of 15:20, 19 March 2024
scientific article; zbMATH DE number 4193723
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
