Coloring d-Embeddable k-Uniform Hypergraphs
classification
🧮 math.CO
keywords
hypergraphschromaticnumberweakk-uniformboundedboundscolor
pith:23274J4N Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{23274J4N}
Prints a linked pith:23274J4N badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
This paper extends the scenario of the Four Color Theorem in the following way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly) embedded into R^d. We investigate lower and upper bounds on the maximum (weak and strong) chromatic number of hypergraphs in H(d,k). For example, we can prove that for d>2 there are hypergraphs in H(2d-3,d) on n vertices whose weak chromatic number is Omega(log n/log log n), whereas the weak chromatic number for n-vertex hypergraphs in H(d,d) is bounded by O(n^((d-2)/(d-1))) for d>2.
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.