ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. Its Euclidean dimension, denoted dim(G)dim(G), is the minimum dimension of a Euclidean space in which GG can be represented with adjacent vertices at unit distance. Let χ(G)\chi(G) be the chromatic number of GG, the minimum number of colors needed to assign colors to the vertices so that adjacent vertices receive different colors. Chromatic upper-bound conjecture. For every graph GG, we have

dim(G)≤2χ(G).dim(G)\le 2\chi(G).

This proposes a chromatic-number upper bound for the Euclidean dimension of graphs, improving on the general estimate discussed in the paper. Its resolution is not established in the supplied text.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.