Generalizations of a Ramsey‐theoretic result of chvátal
作者:
Stefan A. Burr,
Paul Erdös,
期刊:
Journal of Graph Theory
(WILEY Available online 1983)
卷期:
Volume 7,
issue 1
页码: 39-51
ISSN:0364-9024
年代: 1983
DOI:10.1002/jgt.3190070106
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractChvátal has shown that ifTis a tree onnpoints thenr(Kk, T) = (k– 1) (n– 1) + 1, whereris the (generalized) Ramsey number. It is shown that the same result holds whenTis replaced by many other graphs. Such aTis calledk‐good. The results proved all support the conjecture that any large graph that is sufficiently sparse, in the appropriate sense, is
点击下载:
PDF
(618KB)
返 回