Bender et al.'s isomorphism conjecture for uniquely complemented zero-divisor graphs

From papers

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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Anagha Khiste, Ganesh Tarte and Vinayak Joshi, “A Proof of the Conjecture on complemented zero-divisor graphs of semigroups”, arXiv:2604.15535 (2026).

Solutions 0

No solutions have been posted yet.