The third Ramsey numbers for graphs with at most four edges (Q1322298): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 13:21, 31 January 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