Ramsey numbers based on \(C_ 5\)-decompositions (Q1106242): 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 | Ramsey numbers based on \(C_ 5\)-decompositions |
scientific article |
Statements
Ramsey numbers based on \(C_ 5\)-decompositions (English)
0 references
1988
0 references
The authors compute several Ramsey numbers: \(r(C_ 4,K_ 3,K_ 3)=17\); \(r(C_ 4,C_ 4,C_ 4,G)\geq 16\); \(r(K_{2,3},K_{2,4})=12\); where \(C_ 4\) is the circuit of length four, \(K_ 3\) is the complete graph on three vertices, G denotes any connected graph on four or more vertices, and \(K_{2,i}\) is the complete bipartite graph with one vertex set containing two vertices and the other containing i vertices.
0 references
Ramsey numbers
0 references