Local Chromatic Number, KY Fan's Theorem, And Circular Colorings

被引：0
|
作者：
Gábor Simonyi*
Gábor Tardos†
机构：
[1] Hungarian Academy of Sciences,Alfréd Rényi Institute of Mathematics
[2] Simon Fraser University,School of Computing Science
[3] Hungarian Academy of Sciences,Alfréd Rényi Institute of Mathematics
来源：
Combinatorica | 2006年 / 26卷
关键词：
05C15; 55U10;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The local chromatic number of a graph was introduced in [14]. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local chromatic number of graphs for which these quantities are far apart. Such graphs include Kneser graphs, their vertex color-critical subgraphs, the Schrijver (or stable Kneser) graphs; Mycielski graphs, and their generalizations; and Borsuk graphs. We give more or less tight bounds for the local chromatic number of many of these graphs.
引用
收藏
页码：587 / 626
页数：39
相关论文
共 50 条
12345