The list-chromatic number of infinite graphs

被引：4
|
作者：
Komjath, Peter [1 ]
机构：
[1] Eotvos Lorand Univ, Dept Comp, H-1518 Budapest, Hungary
来源：
ISRAEL JOURNAL OF MATHEMATICS | 2013年 / 196卷 / 01期
关键词：
CARDINAL ADDITION; AXIOM;
D O I：
10.1007/s11856-012-0145-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We investigate the list-chromatic number of infinite graphs. It is easy to see that Chr(X) a parts per thousand currency sign List(X) a parts per thousand currency sign Col(X) for each graph X. It is consistent that List(X) = Col(X) holds for every graph with Col(X) infinite. It is also consistent that for graphs of cardinality a"mu (1), List(X) is countable iff Chr(X) is countable.
引用
收藏
页码：67 / 94
页数：28
相关论文
共 50 条
12345