Ramsey numbers based on \(C_ 5\)-decompositions
type: Item
instance of: scholarly article
title: Ramsey numbers based on \(C_ 5\)-decompositions
zbMATH Open document ID: 0651.05050
DOI: 10.1016/0012-365X(88)90065-9
author: Geoffrey Exoo
author: Donald F. Reynolds
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 4061288
zbMATH Keywords: Ramsey numbers
reviewed by: Jack E. Graver
MaRDI profile type: Publication
cites work: Q3216682
cites work: Q4074794
cites work: Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
cites work: Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
cites work: Some small ramsey numbers
cites work: The ramsey number of k5 - e
cites work: Q5520566
cites work: Q3903002
cites work: Combinatorial Relations and Chromatic Graphs
cites work: Parallel concepts in graph theory
cites work: Q5659565
cites work: On Moore Graphs with Diameters 2 and 3
cites work: On ramsey numbers for books
cites work: Lower bounds for small diagonal Ramsey numbers
full work available at URL: 0012-365x(88)90065-9
OpenAlex ID: W2083754735
description: scientific article; zbMATH DE number 4061288