Generalizations of a Ramsey‐theoretic result of chvátal

Stefan A. Burr, P. Erdős

Research output: Contribution to journalArticle

41 Citations (Scopus)

Abstract

Chvátal has shown that if T is a tree on n points then r(Kk, T) = (k – 1) (n – 1) + 1, where r is the (generalized) Ramsey number. It is shown that the same result holds when T is replaced by many other graphs. Such a T is called k‐good. The results proved all support the conjecture that any large graph that is sufficiently sparse, in the appropriate sense, is k‐good.

Original languageEnglish
Pages (from-to)39-51
Number of pages13
JournalJournal of Graph Theory
Volume7
Issue number1
DOIs
Publication statusPublished - 1983

Fingerprint

Ramsey number
Graph in graph theory
Generalization

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Generalizations of a Ramsey‐theoretic result of chvátal. / Burr, Stefan A.; Erdős, P.

In: Journal of Graph Theory, Vol. 7, No. 1, 1983, p. 39-51.

Research output: Contribution to journalArticle

@article{7c9a278708274f6ca69e186e0e603cd2,
title = "Generalizations of a Ramsey‐theoretic result of chv{\'a}tal",
abstract = "Chv{\'a}tal has shown that if T is a tree on n points then r(Kk, T) = (k – 1) (n – 1) + 1, where r is the (generalized) Ramsey number. It is shown that the same result holds when T is replaced by many other graphs. Such a T is called k‐good. The results proved all support the conjecture that any large graph that is sufficiently sparse, in the appropriate sense, is k‐good.",
author = "Burr, {Stefan A.} and P. Erdős",
year = "1983",
doi = "10.1002/jgt.3190070106",
language = "English",
volume = "7",
pages = "39--51",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - Generalizations of a Ramsey‐theoretic result of chvátal

AU - Burr, Stefan A.

AU - Erdős, P.

PY - 1983

Y1 - 1983

N2 - Chvátal has shown that if T is a tree on n points then r(Kk, T) = (k – 1) (n – 1) + 1, where r is the (generalized) Ramsey number. It is shown that the same result holds when T is replaced by many other graphs. Such a T is called k‐good. The results proved all support the conjecture that any large graph that is sufficiently sparse, in the appropriate sense, is k‐good.

AB - Chvátal has shown that if T is a tree on n points then r(Kk, T) = (k – 1) (n – 1) + 1, where r is the (generalized) Ramsey number. It is shown that the same result holds when T is replaced by many other graphs. Such a T is called k‐good. The results proved all support the conjecture that any large graph that is sufficiently sparse, in the appropriate sense, is k‐good.

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

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

U2 - 10.1002/jgt.3190070106

DO - 10.1002/jgt.3190070106

M3 - Article

VL - 7

SP - 39

EP - 51

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -