Algebraic study on Cameron-Walker graphs

By Takayuki Hibi, Akihiro Higashitani, K. Kimura, Augustine O’Keefe. 2013

74 citations recorded by the source corpus.

Let $G$ be a finite simple graph on $[n]$ and $I(G) \subset S$ the edge ideal of $G$, where $S = K[x_{1}, \ldots, x_{n}]$ is the polynomial ring over a field $K$. Let $m(G)$ denote the maximum size of matchings of $G$ and $im(G)$ that of induced matchings of $G$. It is known that $im(G) \leq \text{reg}(S/I(G)) \leq m(G)$, where $\text{reg}(S/I(G))$ is the Castelnuovo-Mumford regularity of $S/I(G)$. Cameron and Walker succeeded in classifying the finite connected simple graphs $G$ with $im(G) = m(G)$. We say that a finite connected simple graph $G$ is a Cameron-Walker graph if $im(G) = m(G)$ and if $G$ is neither a star nor a star triangle. In the present paper, we study Cameron-Walker graphs from a viewpoint of commutative algebra. First, we prove that a Cameron-Walker graph $G$ is unmixed if and only if $G$ is Cohen-Macaulay and classify all Cohen-Macaulay Cameron-Walker graphs. Second, we prove that there is no Gorenstein Cameron-Walker graph. Finally, we prove that every Cameron--Walker graph is sequentially Cohen-Macaulay.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/901f6d80caa9f0be1b7a4b5ef84a84333ecc26e0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

In Computational Theory and Mathematics

In Geometry and Topology

Citations in the corpus

Regularity of Edge Ideals and Their Powers (2017, background): “ds yields to interesting classications, particularly when these bounds coincide. For example, Cameron and Walker [16, Theorem 1] gave the rst classication of graphs Gwith (G) = (G):Then Hibi et al [34] modied their result slightly and gave a full generalization with some corrections. Example 4.5. Le”