On a Ramsey‐type problem
作者:
F. R. K. Chung,
期刊:
Journal of Graph Theory
(WILEY Available online 1983)
卷期:
Volume 7,
issue 1
页码: 79-83
ISSN:0364-9024
年代: 1983
DOI:10.1002/jgt.3190070110
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractSuppose a graphGhas the property that if one colors the edges ofGinrcolors, there always exists a monochromatic triangle. Is it true that if one colors the edges ofGinr+ 1 colors so that every vertex is incident to at mostrcolors then there must be a monochromatic triangle? This problem, which was first raised by P. Erdös, is answered in the negative here
点击下载:
PDF
(211KB)
返 回