New upper and lower bounds for Ramsey numbers
type: Item
instance of: scholarly article
title: New upper and lower bounds for Ramsey numbers
zbMATH Open document ID: 0971.05078
author: Yiru Huang
author: Jiansheng Yang
published in: European Journal of Combinatorics
publication date: 2001-10-30T00:00:00Z
review text: The Ramsey number \(R(G_1, G_2)\) is the smallest integer \(p\) such that for any graph \(G\) on \(p\) vertices either \(G\) contains the graph \(G_1\) or the complement \(\overline G\) of \(G\) contains the graph \(G_2\). The paper presents some new upper and lower bound formulas for \(R(G_1,G_2)\) and \(R(K_m, K_n)\).
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 1567140
zbMATH Keywords: Ramsey graph
zbMATH Keywords: Ramsey number
zbMATH Keywords: bound formulas
MaRDI profile type: Publication
full work available at URL: eujc.2000.0438
OpenAlex ID: W2073908095
cites work: Q5422499
cites work: New upper bounds for Ramsey numbers
cites work: Q4239597
DOI: 10.1006/EUJC.2000.0438
description: scientific article; zbMATH DE number 1567140