Deciding the Chromatic Numbers of Algebraic Hypergrahs

preprint2016arXivOpen access

Abstract

For each infinite cardinal k, the set of algebraic hypergraphs having chromatic number no larger than k is decidable.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.