The NP-hardness conjecture for lower oriented general position number two
Statement
Let be a graph, and let denote the minimum general position number over all orientations of . The lower-number-two hardness conjecture. It is NP-hard to decide whether
The supplied text does not provide a proof or resolution, so the complexity of this decision problem remains open.
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.