Deciding the Chromatic Numbers of Algebraic Hypergrahs
Logic
2016-07-06 v1 Combinatorics
Abstract
For each infinite cardinal k, the set of algebraic hypergraphs having chromatic number no larger than k is decidable.
Cite
@article{arxiv.1607.01377,
title = {Deciding the Chromatic Numbers of Algebraic Hypergrahs},
author = {James H. Schmerl},
journal= {arXiv preprint arXiv:1607.01377},
year = {2016}
}