NP-completeness of coloring finite distance graphs
Statement
Let be a finite set of positive integers, and let denote the chromatic number of the distance graph with distance set . For a fixed integer , consider the decision problem of determining whether . NP-completeness conjecture. Determining whether for finite sets is NP-complete. This conjecture extends the known NP-completeness of deciding whether the chromatic number of a finite graph is at most ; the paper notes that an algorithm exists for computing when is finite, but leaves the efficiency of that algorithm unresolved.
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.