ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let APUD(1,1)\mathrm{APUD}(1,1) denote the corresponding graph class of restricted disk intersection graphs.

APUD(1,1) recognition conjecture. Given a graph GG, it can be determined whether G∈APUD(1,1)G\in\mathrm{APUD}(1,1) in polynomial time.

The preceding characterization gives necessary structural conditions for connected graphs in APUD(1,1)\mathrm{APUD}(1,1), but the source does not establish that they are sufficient. Polynomial-time recognition therefore remains an open problem.

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.