科研之友
微信
新浪微博
Facebook
分享链接
摘要
We consider the structure of K(r)-free graphs with large minimum degree, and show that such graphs with minimum degree delta>(2r-5)n/(2r-3) are homomorphic to the join K(r-3)vH, where H is a triangle-free graph. In particular this allows us to generalize results from triangle-free graphs and show that K(r)-free graphs with such a minimum degree have chromatic number at most r+1. We also consider the minimum-degree thresh-olds for related properties.
- 出版日期2011-4
