NP-completeness of deciding whether the covering number is at most k
Statement
Let be a graph, and let denote the minimum number of equivalence relations needed to cover the line graph structure under the paper's definition. For an integer , the NP-completeness conjecture. It is NP-complete to decide whether or not
The preceding results establish NP-completeness for and ; the conjecture asserts that this remains true for every larger integer .
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.