The list-chromatic number and the coloring number of uncountable graphs

被引：0
|
作者：
Usuba, Toshimichi [1 ]
机构：
[1] Waseda Univ, Fac Sci & Engn, Okubo 3 4 1, Shinjyu ku, Tokyo 1698555, Japan
来源：
ISRAEL JOURNAL OF MATHEMATICS | 2024年 / 259卷 / 01期
关键词：
ALGEBRAS; SPACES;
D O I：
10.1007/s11856-023-2483-y
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We study the list-chromatic number and the coloring number of graphs, especially uncountable graphs. We show that the coloring number of a graph coincides with its list-chromatic number provided that the diamond principle holds. Under the GCH assumption, we prove the singular compactness theorem for the list-chromatic number. We also investigate reflection principles for the list-chromatic number and the coloring number of graphs.
引用
收藏
页码：129 / 167
页数：39
相关论文
共 50 条
12345