Chromatic numbers of algebraic hypergraphs

DOI10.1007/S00493-016-3393-YzbMATH Open1413.05122arXiv1408.4716OpenAlexW2267954656MaRDI QIDQ1990885FDOQ1990885

Authors: James H. Schmerl 

Publication date: 25 October 2018

Published in: Combinatorica (Search for Journal in Brave)

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.

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

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

zbMATH Keywords

chromatic numberinfinite cardinalalgebraic hypergraphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)