DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS

DOI10.1017/jsl.2017.47zbMath1385.05034arXiv1607.01377OpenAlexW2963224680WikidataQ129898392 ScholiaQ129898392MaRDI QIDQ4638981

James H. Schmerl

Publication date: 2 May 2018

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberalgebraic hypergraphs

Mathematics Subject Classification ID

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

Related Items (1)

ACCEPTABLE COLORINGS OF INDEXED HYPERSPACES

Cites Work

• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• An infinite color analogue of Rado's theorem
• Algebraic theories with definable Skolem functions
• Tetrahedron Free Decomposition of R³
• Canonical Partition Relations
• Triangle-Free Partitions of Euclidean Space
• Countable partitions of Euclidean space
• Avoidable algebraic subsets of Euclidean space
• Partitioning Euclidean space
• Partitioning Euclidean space
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS