On graphs related to co-maximal ideals of a commutative ring
Tongsuo Wu, Meng Ye, Dancheng Lu, Houyi Yu

TL;DR
This paper explores the structure and properties of graphs derived from co-maximal ideals in commutative rings, revealing their core composition and relationships with ring invariants like maximal ideals.
Contribution
It introduces and analyzes the co-maximal graph, its induced subgraph, and a related retract, providing new insights into their structure and connection to ring properties.
Findings
Core of the graph is a union of triangles and rectangles.
Vertices are either end vertices or part of the core.
Chromatic and clique numbers equal the number of maximal ideals for non-local rings.
Abstract
This paper studies the co-maximal graph , the induced subgraph of whose vertex set is and a retract of , where is a commutative ring. We show that the core of is a union of triangles and rectangles, while a vertex in is either an end vertex or a vertex in the core. For a non-local ring , we prove that both the chromatic number and clique number of are identical with the number of maximal ideals of . A graph is also introduced on the vertex set , and graph properties of are studied.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Commutative Algebra and Its Applications · Advanced Topics in Algebra
