English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For $d > 0$, define $G(\mathbb{Q}^3, d)$ to be the graph whose set ofvertices is the rational space $\mathbb{Q}^3$, where two vertices are adjacentif and only if they are a Euclidean distance $d$ apart. Let $\chi(\mathbb{Q}^3,d)$ be the chromatic number of such a graph or, in other words, the minimumnumber of colors needed to color the points of $\mathbb{Q}^3$ so that no twopoints at distance $d$ apart receive the same color. An open problem,originally posed by Benda and Perles in the 1970s, asks if there exists $d$such that $\chi(\mathbb{Q}^3, d) = 3$. Through numerous efforts over the years,$\chi(\mathbb{Q}^3, d)$ has been determined for many values of $d$, and for allthose distances $d$ where $\chi(\mathbb{Q}^3, d)$ has not been exactly pinneddown, it is known that $\chi(\mathbb{Q}^3, d) \in \{3,4\}$. In our work, wedetail several search algorithms we have employed to find $4$-chromaticsubgraphs of various graphs $G(\mathbb{Q}^3, d)$ whose chromatic number waspreviously unknown. Ultimately, we conjecture that no $3$-chromatic$G(\mathbb{Q}^3, d)$ exists. Along the way, we pose a few related questionsthat we feel are of interest in their own right.

A Triangle-free, 4-chromatic $\mathbb{Q}^3$ Euclidean Distance Graph Scavenger Hunt!