ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let gp→(G){\rm gp}_{\rightarrow}(G) denote the minimum general position number over all orientations of GG. The lower-number-two hardness conjecture. It is NP-hard to decide whether

gp→(G)=2.{\rm gp}_{\rightarrow}(G)=2.

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 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.