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
Set OpenAlex properties.
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1002/jgt.3190150104 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1002/JGT.3190150104 / rank
 
Normal rank

Latest revision as of 08:50, 31 December 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

    Identifiers