The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
type: Item
instance of: scholarly article
title: The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
zbMATH Open document ID: 1120.05059
author: N. E. Zubov
published in: Discrete Mathematics
publication date: 2007-03-15T00:00:00Z
full work available at URL: http://hdl.handle.net/10397/470
review text: The authors considers Ramsey numbers for cycles of length 6 or 7. For two given graphs \(G_1\) and \(G_2\), the Ramsey number \(R(G_1,G_2)\) is the smallest integer \(n\) such that for any graph \(G\) of order \(n\), either \(G\) contains \(G_1\) or the complement of \(G\) contains \(G_2\). The authors mainly show that \(R(C_6,K_7)=31\) where \(C_m\) denotes a cycle of length \(m\) and \(K_n\) a complete graph of order \(n\).
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 5134173
zbMATH Keywords: Ramsey number
zbMATH Keywords: cycle
zbMATH Keywords: complete graph
reviewed by: Ismail Naci Cangül
MaRDI profile type: Publication
OpenAlex ID: W1975722072
cites work: Q4526625
cites work: Q5422499
cites work: Some Theorems on Abstract Graphs
cites work: On cycle—Complete graph ramsey numbers
cites work: All Ramsey numbers for cycles in graphs
cites work: Some graph theoretic results associated with Ramsey's theorem
cites work: On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
cites work: All cycle‐complete graph Ramsey numbers r(Cm, K6)
cites work: Q4269454
DOI: 10.1016/J.DISC.2006.07.036
description: scientific article; zbMATH DE number 5134173