代数超图的色数
Chromatic Numbers of Algebraic Hypergraphs
摘要：
一个k-一致超图是代数的，如果它的顶点集是n维欧几里得空间，且它的超边集是由某个多项式的零点集定义的.确定了所有代数超图的色数，只要它们是无限的。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
