Chromatic Numbers of Algebraic Hypergraphs
classification
🧮 math.LO
keywords
algebraicchromatichypergraphsnumberssomedefineddeterminedeuclidean
read the original abstract
A k-uniform hypergraph is algebraic if its vertex set is n-dimensional Euclidean space, for some n, and its hyperedge set is defined from the zero set of some polynomial. The chromatic numbers of all algebraic hypergraphs are determined, provided they are infinite.
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.