Chromatic numbers of algebraic hypergraphs

DOI10.1007/S00493-016-3393-YMaRDI QIDQ1990885zbMATH OpenOpenAlexFDO

Authors James H. Schmerl

Publication date 25 October 2018

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.4716

zbMATH Keywords

chromatic numberinfinite cardinalalgebraic hypergraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63) Hypergraphs (05C65)

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.

Recommendations

• A geometric theory of hypergraph colouring
• Zero-free intervals of chromatic polynomials of hypergraphs
• A contribution to the chromatic theory of uniform hypergraphs
• Hypergraphs with high chromatic number
• Chromatic polynomials of hypergraphs

Cites work

• scientific article; zbMATH DE number 496012 (Why is no real title available?)
• A Decomposition Theorem for R n
• An infinite color analogue of Rado's theorem
• Avoidable algebraic subsets of Euclidean space
• Countable partitions of Euclidean space
• GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES
• Measurable sets with excluded distances
• Partitioning Euclidean space
• Partitioning Euclidean space
• Tetrahedron Free Decomposition of R³
• The Mathematical Coloring Book
• Triangle-Free Partitions of Euclidean Space

Cited in

(2)

• Independent sets in algebraic hypergraphs
• An algebraic formulation of hypergraph colorings

This page was built for publication: Chromatic numbers of algebraic hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990885)