Related Experiment Video
Updated: Apr 20, 2026

Applying Hyperspectral Reflectance Imaging to Investigate the Palettes and the Techniques of Painters
Published on: June 18, 2021
Coloring [Formula: see text]-Embeddable [Formula: see text]-Uniform Hypergraphs
Carl Georg Heise1, Konstantinos Panagiotou2, Oleg Pikhurko3
1Institut für Mathematik, Technische Universität Hamburg-Harburg, Hamburg, Germany.
Abstract:
This paper extends the scenario of the Four Color Theorem in the following way. Let [Formula: see text] be the set of all [Formula: see text]-uniform hypergraphs that can be (linearly) embedded into [Formula: see text]. We investigate lower and upper bounds on the maximum (weak) chromatic number of hypergraphs in [Formula: see text]. For example, we can prove that for [Formula: see text] there are hypergraphs in [Formula: see text] on [Formula: see text] vertices whose chromatic number is [Formula: see text], whereas the chromatic number for [Formula: see text]-vertex hypergraphs in [Formula: see text] is bounded by [Formula: see text] for [Formula: see text].
Related Concept Videos
Graphical Representation of Inequalities
Graphs of Functions
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Hyperbolas
Geometry of Hyperbolas
Graphs of Equations in Two Variables

