A Ramsey problem of Harary on graphs with prescribed size
type: Item
instance of: scholarly article
title: A Ramsey problem of Harary on graphs with prescribed size
zbMATH Open document ID: 0624.05047
DOI: 10.1016/0012-365X(87)90173-7
author: Ralph Faudree
author: Cecil Rousseau
author: R. H. Schelp
author: P. Erdős
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: This paper contains several results relation the ``sizes'' of graphs and bounds on the corresponding Ramsey numbers. Two typical results: For any graph \(G\) with edges and no isolate vertices, \(r(K_3,G)\leq [8q/3]\). For a fixed graph \(G\) with \(p\) vertices (\(p\geq 3\)) and \(q\) edges, there exists a constant \(C\) such that for \(n\) sufficiently large, \(r(G,K_n)>C(n/\log(n))^{(p-1)(p-2)}\).
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 4012659
zbMATH Keywords: Ramsey numbers
reviewed by: Jack E. Graver
MaRDI profile type: Publication
cites work: Q3907602
cites work: Q4120601
cites work: Parallel concepts in graph theory
cites work: Asymptotic lower bounds for Ramsey functions
full work available at URL: 0012-365x(87)90173-7
OpenAlex ID: W1994323471
description: scientific article; zbMATH DE number 4012659