ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph GG is planar if it can be drawn in the plane without edge crossings. For a graph class H\mathcal{H}, the H\mathcal{H}-square-root problem asks whether a given graph has a square root belonging to H\mathcal{H}.

Planar square-root conjecture. The H\mathcal{H}-square-root problem is NP-complete for the class H\mathcal{H} of planar graphs.

The paper proves NP-completeness for the class of 66-apex graphs, which is minor-closed and lies at the bottom of the bounded-expansion hierarchy. It remains open whether the apex vertices are necessary, or whether the planar square-root problem is already hard.

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.