Bender et al.'s reduced-graph conjecture for complemented zero-divisor graphs

Let SS be a finite commutative semigroup with zero, and let G(S)G(S) be its zero-divisor graph. A graph is complemented if every vertex is orthogonal to some vertex, where adjacent vertices are orthogonal when no third vertex is adjacent to both. Let \boxempty\boxempty denote the clique number, let GrG_r be the reduced graph obtained by identifying vertices with the same neighborhood, and let P(n)\mathcal{P}(n) be the semigroup of subsets of an nn-element set under intersection. Bender et al.'s reduced-graph conjecture. If G(S)G(S) is a complemented zero-divisor graph with the clique number n\theseq3n\theseq 3, then G(S)G(S) has reduced graph GrG_r isomorphic to G(P(n))G(\mathcal{P}(n)). The paper gives counterexamples to the motivating conjectures, so this claim is not supported as an open conjecture in the source context.

Sources & referencesView supporting material

Primary source

Anagha Khiste, Ganesh Tarte and Vinayak Joshi, “Counter-example to Conjectures on Complemented Zero-Divisor Graphs of Semigroups”, arXiv:2506.16919 (2025).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.