不可数图的列表色数与色数
The list-chromatic number and the coloring number of uncountable graphs
摘要：
本文研究了图的列表色数和色数，特别是不可数图。证明了在钻石原理成立的条件下，图的色数与它的列表色数是一致的。在GCH假设下，证明了列表-色数的奇异紧性定理。本文还研究了图的列表色数和色数的反射原理。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
