NP-hardness conjecture for recognizing generic-radii sphere-packing contact graphs
Statement
A graph is a generic-radii sphere-packing contact graph if it is the contact graph of a sphere packing whose radii are generic. NP-hardness conjecture. Determining whether a graph is a generic-radii sphere-packing contact graph is NP-hard. The question is connected to recognizing penny graphs, and the source notes evidence for related NP-hardness results, but the stated problem remains unresolved.
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.