The list-chromatic number and the coloring number of uncountable graphs
被引:0
|
作者:
Usuba, Toshimichi
论文数: 0引用数: 0
h-index: 0
机构:
Waseda Univ, Fac Sci & Engn, Okubo 3 4 1, Shinjyu ku, Tokyo 1698555, JapanWaseda Univ, Fac Sci & Engn, Okubo 3 4 1, Shinjyu ku, Tokyo 1698555, Japan
Usuba, Toshimichi
[1
]
机构:
[1] Waseda Univ, Fac Sci & Engn, Okubo 3 4 1, Shinjyu ku, Tokyo 1698555, Japan
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.
机构:
Hebrew Univ Jerusalem, Einstein Inst Math, IL-91904 Jerusalem, Israel
Rutgers State Univ, Hill Ctr, Dept Math, Piscataway, NJ 08854 USAHebrew Univ Jerusalem, Einstein Inst Math, IL-91904 Jerusalem, Israel
机构:
Nanjing Normal Univ, Inst Math, Sch Math Sci, Nanjing 210023, Jiangsu, Peoples R ChinaNanjing Normal Univ, Inst Math, Sch Math Sci, Nanjing 210023, Jiangsu, Peoples R China
Xu, Baogang
Zhang, Yingli
论文数: 0引用数: 0
h-index: 0
机构:
Nanjing Normal Univ, Inst Math, Sch Math Sci, Nanjing 210023, Jiangsu, Peoples R ChinaNanjing Normal Univ, Inst Math, Sch Math Sci, Nanjing 210023, Jiangsu, Peoples R China