An upper bound for the Ramsey number M(5,4) (Q2548609): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users 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.1016/0097-3165(71)90002-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074502796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Relations and Chromatic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniqueness theorem for edge-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Colouring and Combinatorial Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some graph theoretic results associated with Ramsey's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for some Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichromatic graphs and Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Acquaintances and Strangers at any Party / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5577107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5562008 / rank
 
Normal rank

Latest revision as of 03:52, 12 June 2024

scientific article
Language Label Description Also known as
English
An upper bound for the Ramsey number M(5,4)
scientific article

    Statements