The $k^{\text th}$ Upper Chromatic Number of the Line

TL;DR

This paper investigates the $k^{th}$ upper chromatic number of the real line, establishing that it is finite for all natural numbers $k$, which advances understanding of coloring problems related to distances.

Contribution

The paper proves that the $k^{th}$ upper chromatic number of the real line is finite for all positive integers $k$, providing a significant result in distance-based coloring theory.

Findings

${ m ilde{oldsymbol{ ext{ extasciicircum}}}}^{(k)}( extbf{R})$ is finite for all $k$

Established bounds for the $k^{th}$ upper chromatic number of $ extbf{R}$

Contributed to the theory of distance-based graph colorings

Abstract

Let $S \subseteq \mathbb{R}^n$, and let $k\in\mathbb{N}$. Greenwell and Johnson define ${\hat\chi\ }^{(k)}(S)$ to be the smallest integer $m$ (if such an integer exists) such that for every $k\times m$ array $D=(d_{ij})$ of positive real numbers, $S$ can be colored with the colors $C_1,\ldots,C_m$ such that no two points of $S$ which are a (Euclidean) distance $d_{ij}$ apart are both colored $C_j$, for all $1\leq i \leq k$ and $1\leq j \leq m$. If no such integer exists then we say that ${\hat\chi\ }^{(k)}(S)=\infty$. In this paper we show that ${\hat\chi\ }^{(k)}(\mathbb{R})$ is finite for all $k$.