Domination and maximal intersecting families in comaximal graphs of commutative rings

@misc{mehdinezhad2026domination,
  title = {{Domination and maximal intersecting families in comaximal graphs of commutative rings}},
  author = {Elham Mehdi-Nezhad},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.08022},
  eprint = {2611.08022},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.08022},
}

TY  - UNPB
TI  - Domination and maximal intersecting families in comaximal graphs of commutative rings
AU  - Elham Mehdi-Nezhad
PY  - 2026
DA  - 2026/11/05
PB  - arXiv
DO  - 10.48550/arxiv.2611.08022
UR  - https://arxiv.org/abs/2611.08022
AB  - The comaximal graph 𝒢(R) of a commutative ring R has as vertices the nonunits outside the Jacobson radical, two being adjacent if they generate R as an ideal. For rings with k≥ 4 maximal ideals, only the bounds 2≤γ(𝒢(R))≤ k were known, to our knowledge. We prove γ=γ_t=γ_c=k whenever 3≤ k<∞, without finiteness or Artinian hypotheses, classify the minimum dominating sets, and determine the domatic number. Independent dominating sets correspond to maximal intersecting families of subsets of {1,…,k}; we obtain a closed formula for the independent domination number of every finite non-local ring, which can be exponentially larger than the domination number. The proofs rest on the class sizes of the blow-up description of 𝒢(R) due to Moconja and Petrović, which we determine for every ring with finitely many maximal ideals, finite or infinite; with them, domination problems on 𝒢(R) become weighted extremal problems on subsets of {1,…,k}, and the formula for the independent domination number follows from the multiplicative form of these sizes. We also treat rings with infinitely many maximal ideals, graph polynomials, and lattices whose maximal ideals are prime.
ER  -