New Construction of Graphs with High Chromatic Number and Small Clique Number

被引：0
|
作者：
Hamid Reza Daneshpajouh
机构：
[1] Institute for Research in Fundamental Sciences (IPM),School of Mathematics
[2] Moscow Institute of Physics and Technology,undefined
来源：
Discrete & Computational Geometry | 2018年 / 59卷
关键词：
Borsuk–Ulam theorem; Chromatic number; Tucker’s lemma; Triangle-free graphs; 05C15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We introduce a new method for constructing graphs with high chromatic number and small clique number. Indeed, we present a new proof for the well-known Kneser conjecture via this method.
引用
收藏
页码：238 / 245
页数：7
相关论文
共 50 条
12345