Conjecture on the complexity of the k-general d-position problem
Statement
The -general -position problem takes as input a graph , integers and , and a positive integer , and asks whether is greater than . Complexity conjecture. The -general -position problem is -complete. This conjecture is motivated by the known NP-completeness of the general -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.