Deciding the Chromatic Numbers of Algebraic Hypergrahs

2016/07/05 by James H. Schmerl, Schmerl, James H.
Mathematics · Computer Science · #Advanced Topology and Set Theory #Limits and Structures in Graph Theory #Advanced Graph Theory Research

paper · pdf · doi:10.48550/arxiv.1607.01377

Abstract

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

Related

• Chromatic Numbers of Algebraic Hypergraphs
• Coloring redundant algebraic hypergraphs
• Obligatory hypergraphs
• Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
• Polynomial bounds for chromatic number. II. Excluding a star-forest