ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let σ(G)\sigma(G) denote the minimum number of equivalence relations needed to cover the line graph structure under the paper's definition. For an integer k≥3k\geq 3, the NP-completeness conjecture. It is NP-complete to decide whether or not

σ(G)≤k.\sigma(G)\leq k.

The preceding results establish NP-completeness for k=3k=3 and k=4k=4; the conjecture asserts that this remains true for every larger integer kk.

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.