The regularity and $h$-polynomial of Cameron-Walker graphs
Combinatorics
2020-03-18 v1 Commutative Algebra
Abstract
Fix an integer , and consider the set of all connected finite simple graphs on vertices. For each in this set, let denote the edge ideal of in the polynomial ring . We initiate a study of the set consisting of all the pairs where , the Castelnuovo-Mumford regularity, and , the degree of the -polynomial, as we vary over all the connected graphs on vertices. In particular, we identify sets and such that . When we restrict to the family of Cameron-Walker graphs on vertices, we can completely characterize all the possible .
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