English

The regularity and $h$-polynomial of Cameron-Walker graphs

Combinatorics 2020-03-18 v1 Commutative Algebra

Abstract

Fix an integer n1n \geq 1, and consider the set of all connected finite simple graphs on nn vertices. For each GG in this set, let I(G)I(G) denote the edge ideal of GG in the polynomial ring R=K[x1,,xn]R = K[x_1,\ldots,x_n]. We initiate a study of the set RD(n)N2\mathcal{RD}(n) \subseteq \mathbb{N}^2 consisting of all the pairs (r,d)(r,d) where r=reg(R/I(G))r = {\rm reg}(R/I(G)), the Castelnuovo-Mumford regularity, and d=deghR/I(G)(t)d = {\rm deg} h_{R/I(G)}(t), the degree of the hh-polynomial, as we vary over all the connected graphs on nn vertices. In particular, we identify sets A(n)A(n) and B(n)B(n) such that A(n)RD(n)B(n)A(n) \subseteq \mathcal{RD}(n) \subseteq B(n). When we restrict to the family of Cameron-Walker graphs on nn vertices, we can completely characterize all the possible (r,d)(r,d).

Keywords

Cite

@article{arxiv.2003.07416,
  title  = {The regularity and $h$-polynomial of Cameron-Walker graphs},
  author = {Takayuki Hibi and Kyouko Kimura and Kazunori Matsuda and Adam Van Tuyl},
  journal= {arXiv preprint arXiv:2003.07416},
  year   = {2020}
}

Comments

15 pages; comments welcomed

R2 v1 2026-06-23T14:16:41.207Z