The third Ramsey numbers for graphs with at most four edges (Q1322298): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q323047 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Jack E. Graver / rank | |||
Normal rank |
Revision as of 00:41, 13 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The third Ramsey numbers for graphs with at most four edges |
scientific article |
Statements
The third Ramsey numbers for graphs with at most four edges (English)
0 references
9 June 1994
0 references
Given a graph \(H\) and a positive integer \(n\), the Ramsey number \(r_ n (H)\) is defined to be the least integer \(p\) such that given any edge \(n\)- coloring of the complete graph on \(p\) vertices, \(K_ p\), there will always be a monochromatic copy of \(H\) in \(K_ p\). Using a computer, the authors have evaluated \(r_ 3 (H)\) for all 19 of the graphs on at most four edges which admit no isolated vertices.
0 references
Ramsey number
0 references