A New Class of Geometrically Defined Hypergraphs Arising from the Hadwiger Nelson Problem

There is a famous problem in geometric graph theory to find the chromatic number of the unit distance graph on Euclidean space; it remains unsolved. A theorem of Erdos and De-Bruijn simplifies this problem to finding the maximum chromatic number of a finite unit distance graph. Via a construction built on sequential finite graphs obtained from a generalization of this theorem, we have found a class of geometrically defined hypergraphs of arbitrarily large edge cardinality, whose proper colorings exactly coincide with the proper colorings of the unit distance graph on ${\mathbb{R}}^d$. We also provide partial generalizations of this result to arbitrary real normed vector spaces.