Ramsey numbers for unions of some cycles
type: Item
instance of: scholarly article
title: Ramsey numbers for unions of some cycles
zbMATH Open document ID: 0636.05039
DOI: 10.1016/0012-365X(88)90056-8
author: Hirobumi Mizuno
author: Iwao Sato
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: Let G and H be two graphs and let r(G,H) denote the Ramsey number defined as follows: r(G,H) is the smallest positive integer p so that, if the edges of the complete graph on p vertices are colored with two colors then either there is a subgraph isomorphic to G with all of its edges colored with the first color or a subgraph isomorphic to H with all of its edges colored with the second color. In this paper, the authors compute the exact values for \(r(C_ 4\cup C_ m\), \(C_ 4\cup C_ n)\), \(r(mC_ n\), \(mC_ 4)\), \(r(m(C_ 3\cup C_ 4)\), \(n(C_ 3\cup C_ 4))\) for most values of m and n.
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4035875
zbMATH Keywords: cycles
zbMATH Keywords: Ramsey number
reviewed by: Jack E. Graver
MaRDI profile type: Publication
cites work: Q4187840
cites work: Ramsey numbers for cycles in graphs
cites work: Ramsey Theorems for Multiple Copies of Graphs
cites work: All Ramsey numbers for cycles in graphs
cites work: Q5548200
cites work: Ramsey numbers for quadrangles and triangles
cites work: On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
description: scientific article; zbMATH DE number 4035875