The chromatic upper-bound conjecture for Euclidean dimension of graphs
Statement
Let be a graph. Its Euclidean dimension, denoted , is the minimum dimension of a Euclidean space in which can be represented with adjacent vertices at unit distance. Let be the chromatic number of , 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 , we have
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.