The Ramsey number of an \(n\)-edge graph versus triangle is at most \(2n+1\)
type: Item
instance of: scholarly article
title: The Ramsey number of an \(n\)-edge graph versus triangle is at most \(2n+1\)
zbMATH Open document ID: 0794.05090
author: Alexander Sidorenko
published in: Journal of Combinatorial Theory. Series B
publication date: 1994-06-15T00:00:00Z
review text: The Ramsey number \(r(H,G)\) is defined as the minimal \(N\) such that for any coloring of the edges of the \(N\)-vertex complete graph \(K_ N\) in red and blue, it must contain either a red \(H\) or a blue \(G\). We prove the conjecture of Harary that for any graph \(G\) with \(n\) edges and without isolated vertices, \(r(K_ 3,G)\leq 2n+1\).
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 572444
zbMATH Keywords: triangle
zbMATH Keywords: Ramsey number
zbMATH Keywords: conjecture of Harary
MaRDI profile type: Publication
full work available at URL: jctb.1993.1036
OpenAlex ID: W2077788572
DOI: 10.1006/JCTB.1993.1036
description: scientific article; zbMATH DE number 572444