ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a commutative semigroup with 00, and let G(S)G(S) be its zero-divisor graph. A graph is uniquely complemented if it is complemented and any two complements of the same vertex have equal neighborhoods. A vertex has a unique complement when it has exactly one complement. Let P(n)\mathcal{P}(n) be the semigroup given by the power set of an nn-element set under intersection.

Bender et al.'s conjecture. If G(S)G(S) is uniquely complemented with clique number 33 or greater and every vertex has a unique complement, then G(S)G(S) is isomorphic to G(P(n))G(\mathcal{P}(n)), where nn is the clique number of G(S)G(S).

This is one of three conjectures attributed in the source to C. Bender et al. The supplied material gives no evidence that the statement has been resolved.

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.