ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Point-determining graph conjecture. The number of unlabelled point-determining graphs of a given order equals the number of unlabelled endpoint-free graphs of that order.

This proposes an enumerative correspondence between two classes of graphs, but the supplied text gives no definitions or evidence establishing the equality or indicating its status.

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.