Search arXivSearch

arXiv · 2606.15498

Inclusion graph of annihilators in a commutative ring

Abstract

Let $R$ be a commutative ring with identity, and let $Z(R)$ be the set of zero-divisors of $R$. The inclusion graph of annihilators in $R$, denoted by $Γ^{\prime}(R)$, is a graph with the vertex set $Z(R)^*=Z(R)\setminus\{0\}$ and two distinct vertices $x$ and $y$ are adjacent if and only if $\operatorname{ann}_R(x)\subseteq \operatorname{ann}_R(y)$ or $\operatorname{ann}_R(y)\subseteq \operatorname{ann}_R(x)$. It is proved that $Γ^{\prime}(R)$ is not connected if and only if $R$ is reduced with $|\operatorname{Min}(R)|=2$. Also, we show that if $Γ^{\prime}(R)$ is a connected graph, then the diameter of $Γ^{\prime}(R)$ is at most $4$ and the girth of $Γ^{\prime}(R)$ is at most $6$, if it contains a cycle. Moreover, we study the affinity between inclusion graph of annihilators and complement of the annihilator graph (a well-known graph with the same vertices and two distinct vertices $x$ and $y$ are adjacent if and only if $\operatorname{ann}_R(xy)\neq \operatorname{ann}_R(x)\cup \operatorname{ann}_R(y)$) associated with a commutative ring. Finally, we characterize all rings whose inclusion graphs of annihilators are complete.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hana Safari, Farzad Shaveisi, Reza Nikandish. 2026-06-13. Inclusion graph of annihilators in a commutative ring. https://arxiv.org/abs/2606.15498

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO