MAX-VP completeness conjecture
Statement
Let be a graph, let be an integer, and let a numbering assign the integers distinctly to the vertices of . A valid path is a 2-path whose middle vertex has a smaller number than both endpoints. MAX-VP completeness conjecture. Deciding whether has a numbering that induces at least valid paths is an -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.