More on Compactness of Chromatic Numbers
Abstract
We prove that for any regular kappa and mu > kappa below the first fix point (lambda = alephlambda) above kappa, there is a graph with chromatic number > kappa, and mukappa nodes but every subgraph of cardinality < mu has chromatic number less than or equal to kappa.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.