Linear quotients of connected ideals of graphs
Commutative Algebra
2025-04-02 v3 Combinatorics
Abstract
As a higher analogue of the edge ideal of a graph, we study the -connected ideal . This is the monomial ideal generated by the connected subsets of size . For chordal graphs, we show that has a linear resolution iff the tree is -gap-free, and that this is equivalent to having linear quotients. We then show that if is any gap-free and -claw-free graph, then has linear quotients and, hence, linear resolution.
Cite
@article{arxiv.2401.01046,
title = {Linear quotients of connected ideals of graphs},
author = {H. Ananthnarayan and Omkar Javadekar and Aryaman Maithani},
journal= {arXiv preprint arXiv:2401.01046},
year = {2025}
}
Comments
12 pages. This is the final version of the article, which has now appeared in the Journal of Algebraic Combinatorics