ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The kk-general dd-position problem takes as input a graph GG, integers k≥2k\geq 2 and d≥1d\geq 1, and a positive integer rr, and asks whether gpdk(G)\mathrm{gp}^k_d(G) is greater than rr. Complexity conjecture. The kk-general dd-position problem is NP⁡\operatorname{NP}-complete. This conjecture is motivated by the known NP-completeness of the general dd-position problem. The source does not give a proof or indicate that the conjecture has been resolved.

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.