首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到1条相似文献,搜索用时 15 毫秒
1.
The -complexes were introduced by Lovász to study topological obstructions to graph colorings. It was conjectured by Babson and Kozlov, and proved by Cukic and Kozlov, that is -connected, where is the maximal degree of a vertex of , and the number of colors. We give a short proof of the conjecture.

  相似文献   


设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号