ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let kk be an integer, and let a numbering assign the integers {1,…,n}\{1,\dots,n\} distinctly to the vertices of GG. A valid path is a 2-path whose middle vertex has a smaller number than both endpoints. MAX-VP completeness conjecture. Deciding whether GG has a numbering that induces at least kk valid paths is an NP\mathcal{NP}-complete decision problem. MAX-VP is the maximisation version of the valid-path optimisation problem. The source presents this as a conjecture and gives no proof or resolution.

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.