A Proof of the Conjecture on complemented zero-divisor graphs of semigroups
Pith reviewed 2026-05-10 10:11 UTC · model grok-4.3
The pith
If the zero-divisor graph of a semigroup is uniquely complemented with clique number at least 3 and every vertex has a unique complement, then the graph is isomorphic to the zero-divisor graph of the power set semigroup on n elements.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
If G(S) is the zero-divisor graph of a semigroup S that is uniquely complemented, has clique number n at least 3, and every vertex has a unique complement, then G(S) is isomorphic to G(𝒫(n)), the zero-divisor graph of the power set semigroup on n elements.
What carries the argument
The combination of the uniquely complemented property and the unique-complement-per-vertex condition, which together force the edge and non-edge relations to match those of the power-set construction.
If this is right
- All zero-divisor graphs satisfying the stated conditions are determined completely by their clique number.
- The algebraic structure of the underlying semigroup is constrained to produce exactly the adjacency pattern of the power-set example.
- No other non-isomorphic graphs exist under these hypotheses.
- The original conjecture is resolved in the affirmative for all such graphs.
Where Pith is reading between the lines
- The result may allow researchers to translate questions about semigroup multiplication into questions about subset intersection or union in the power-set model.
- Similar rigidity arguments could be tested on other graph invariants such as diameter or girth for the same class of semigroups.
- If the unique-complement condition is relaxed, the classification may split into additional families whose graphs differ from the power-set case.
Load-bearing premise
The zero-divisor graph must be uniquely complemented and every vertex must have exactly one complement.
What would settle it
A semigroup S whose zero-divisor graph is uniquely complemented with clique number n at least 3, every vertex has a unique complement, yet the graph fails to be isomorphic to G of the power set on n elements.
read the original abstract
In this paper, we are motivated by the conjectures proposed by C.~Bender \textit{et al.}, \cite{C} in 2024. We have settled the first two conjectures negatively by providing a counter example in \cite{KTJ}, whereas in this paper, we prove the third conjecture positively, which has remained an open question until now. The third conjecture is stated as if $G(S)$ is uniquely complemented with the clique number $3$ or greater and has the property that every vertex has a unique complement, then the graph $G(S)$ is isomorphic to the graph $G(\mathcal{P}(n))$, where $n$ is the clique number of $G(S)$.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proves the third conjecture of Bender et al. (2024) on complemented zero-divisor graphs of semigroups. It claims that if the zero-divisor graph G(S) is uniquely complemented, has clique number n ≥ 3, and every vertex has a unique complement, then G(S) is isomorphic to G(𝒫(n)) for the semigroup 𝒫(n) with that clique number. The argument relies on the standard zero-divisor adjacency relation in a semigroup, the unique-complement hypothesis, and exhaustive case analysis over maximal cliques and complement pairs to force the vertex set and edges to match those of G(𝒫(n)).
Significance. If the proof holds, the result supplies a complete structural classification of uniquely complemented zero-divisor graphs satisfying the stated conditions, thereby resolving an open conjecture in the positive direction after the authors' earlier negative resolutions of the first two conjectures via counterexamples. The derivation uses only the semigroup axioms and the given graph-theoretic hypotheses, with no additional assumptions on commutativity or finiteness, and proceeds via direct case analysis on complements and cliques.
minor comments (2)
- [Introduction] The semigroup 𝒫(n) is referenced repeatedly as the target of the isomorphism but is not defined explicitly in the introduction or preliminaries; a short paragraph recalling its construction (e.g., as the power-set semigroup under a suitable operation) would improve accessibility.
- [Section 4] In the case analysis for n ≥ 4 (Section 4), the enumeration of complement configurations is presented only in prose; a compact table listing the possible adjacency patterns for each case would make the exhaustive verification easier to follow.
Simulated Author's Rebuttal
We thank the referee for the careful reading, the positive assessment of the significance of our result, and the recommendation of minor revision. The manuscript establishes the third conjecture of Bender et al. (2024) by showing that any uniquely complemented zero-divisor graph with clique number n ≥ 3 in which every vertex has a unique complement must be isomorphic to G(𝒫(n)). The proof proceeds via exhaustive case analysis on maximal cliques and complement pairs under the standard zero-divisor adjacency relation, without assuming commutativity or finiteness.
Circularity Check
No significant circularity; direct proof of external conjecture
full rationale
The manuscript presents a standard mathematical proof of the third conjecture from Bender et al. (2024). It begins from the standard definition of the zero-divisor graph G(S) on a semigroup, imposes the external hypotheses of unique complementation with clique number n ≥ 3 and unique complements for every vertex, and proceeds via exhaustive case analysis on complements and maximal cliques to establish the isomorphism to G(P(n)). All steps rest on semigroup axioms and the stated graph-theoretic assumptions; the prior counterexamples in the authors' own [KTJ] paper address separate conjectures and are not invoked as load-bearing premises here. No self-definitional reductions, fitted inputs renamed as predictions, or ansatzes smuggled via self-citation occur.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math Standard definitions and properties of zero-divisor graphs and complemented graphs in semigroups
Reference graph
Works this paper leans on
-
[1]
D. Anderson and P. Livingstone,The zero-divisor graph of a commutative ring, J. Algebra,217(1999), 434-447
work page 1999
-
[2]
D. Anderson and M. Naseer,Beck’s coloring of a commutative ring, J. Algebra,159(1993), 500–514
work page 1993
-
[3]
Beck,Coloring of commutative rings, J
I. Beck,Coloring of commutative rings, J. Algebra,116(1988), 208-226
work page 1988
- [4]
-
[5]
F. DeMeyer, L. DeMeyer,Zero-divisor graphs of semigroups, J. Algebra,283(2005), 190–198
work page 2005
-
[6]
F. DeMeyer, T. McKenzie and K. Schneider,The zero-divisor graph of a commutative semigroup, Semigroup Forum, 65(2002), 206-214
work page 2002
- [7]
-
[8]
LaGrange,Complemented zero divisor graphs and Boolean rings, J
J. LaGrange,Complemented zero divisor graphs and Boolean rings, J. Algebra,315(2007), 600-611
work page 2007
- [9]
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.