ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p,qp,q be positive integers with p≥1p\geq 1 and q≥2q\geq 2, and let i≤pi\leq p and j≤qj\leq q. Let Ψ\Psi be a family of graphs for which recognizing generating subgraphs isomorphic to Ki,jK_{i,j} is NP-complete. Monotonicity conjecture. Then recognizing generating subgraphs of graphs in Ψ\Psi isomorphic to Kp,qK_{p,q} is NP-complete as well. This conjecture proposes that NP-completeness for recognizing generating subgraphs isomorphic to a smaller complete bipartite graph extends to larger complete bipartite graphs within the same family. The paper establishes the corresponding complexity results for the relevant complete bipartite graphs by minor modifications of an earlier proof, but the stated general implication is presented as a conjecture.

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.