List chromatic numbers and singular compactness
Shimon Garti
TL;DR
This paper proves that the list chromatic number of graphs exhibits singular compactness at strong limit singular cardinals, advancing understanding in graph coloring and set theory.
Contribution
It establishes a new singular compactness property for list chromatic numbers at certain large cardinals, a novel result in graph theory and set theory.
Findings
List chromatic number satisfies singular compactness at strong limit singular cardinals.
Provides a new connection between graph coloring and large cardinal properties.
Advances the theoretical understanding of graph coloring in the context of set theory.
Abstract
We prove that the list chromatic number of graphs satisfies singular compactness at strong limit singular cardinals.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Homotopy and Cohomology in Algebraic Topology