Deciding the Chromatic Numbers of Algebraic Hypergrahs
Abstract
For each infinite cardinal k, the set of algebraic hypergraphs having chromatic number no larger than k is decidable.
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.