Deciding the Chromatic Numbers of Algebraic Hypergrahs
classification
🧮 math.LO
math.CO
keywords
algebraicchromaticcardinaldecidabledecidinghavinghypergrahshypergraphs
read the original abstract
For each infinite cardinal k, the set of algebraic hypergraphs having chromatic number no larger than k is decidable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.