Ramsey bounds for graph products

P. Erdős, Robert J. McEliece, Herbert Taylor

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Here we show that Ramsey numbers M(k1,..., kn) give sharp upper bounds for the independence numbers of product graphs, in terms of the independence numbers of the factors.

Original languageEnglish
Pages (from-to)45-46
Number of pages2
JournalPacific Journal of Mathematics
Volume37
Issue number1
Publication statusPublished - 1971

Fingerprint

Graph Products
Independence number
Product Graph
Ramsey number
Upper bound

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Erdős, P., McEliece, R. J., & Taylor, H. (1971). Ramsey bounds for graph products. Pacific Journal of Mathematics, 37(1), 45-46.

Ramsey bounds for graph products. / Erdős, P.; McEliece, Robert J.; Taylor, Herbert.

In: Pacific Journal of Mathematics, Vol. 37, No. 1, 1971, p. 45-46.

Research output: Contribution to journalArticle

Erdős, P, McEliece, RJ & Taylor, H 1971, 'Ramsey bounds for graph products', Pacific Journal of Mathematics, vol. 37, no. 1, pp. 45-46.
Erdős, P. ; McEliece, Robert J. ; Taylor, Herbert. / Ramsey bounds for graph products. In: Pacific Journal of Mathematics. 1971 ; Vol. 37, No. 1. pp. 45-46.
@article{6dc63123e94e4096984490f79559dc7d,
title = "Ramsey bounds for graph products",
abstract = "Here we show that Ramsey numbers M(k1,..., kn) give sharp upper bounds for the independence numbers of product graphs, in terms of the independence numbers of the factors.",
author = "P. Erdős and McEliece, {Robert J.} and Herbert Taylor",
year = "1971",
language = "English",
volume = "37",
pages = "45--46",
journal = "Pacific Journal of Mathematics",
issn = "0030-8730",
publisher = "University of California, Berkeley",
number = "1",

}

TY - JOUR

T1 - Ramsey bounds for graph products

AU - Erdős, P.

AU - McEliece, Robert J.

AU - Taylor, Herbert

PY - 1971

Y1 - 1971

N2 - Here we show that Ramsey numbers M(k1,..., kn) give sharp upper bounds for the independence numbers of product graphs, in terms of the independence numbers of the factors.

AB - Here we show that Ramsey numbers M(k1,..., kn) give sharp upper bounds for the independence numbers of product graphs, in terms of the independence numbers of the factors.

UR - http://www.scopus.com/inward/record.url?scp=0007624516&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0007624516&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0007624516

VL - 37

SP - 45

EP - 46

JO - Pacific Journal of Mathematics

JF - Pacific Journal of Mathematics

SN - 0030-8730

IS - 1

ER -