ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a finite set of positive integers, and let χ(D)\chi(D) denote the chromatic number of the distance graph with distance set DD. For a fixed integer k≥3k\ge3, consider the decision problem of determining whether χ(D)≤k\chi(D)\le k. NP-completeness conjecture. Determining whether χ(D)≤k\chi(D)\le k for finite sets DD is NP-complete. This conjecture extends the known NP-completeness of deciding whether the chromatic number of a finite graph is at most kk; the paper notes that an algorithm exists for computing χ(D)\chi(D) when DD 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 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.