Scarf complexes of connected and path ideals
Commutative Algebra
2025-12-09 v2 Combinatorics
Abstract
The -connected ideal of a graph is generated by all connected induced subgraphs of with vertices. When , this coincides with the usual edge ideal of the graph. Following the work of Faridi et al., we give a classification of the graphs whose -connected ideals are minimally resolved by their Scarf complex. We also consider the -path ideal of a graph which is the ideal generated by all paths of length in . In this case, we are able to give a classification of the same type for paths of length .
Cite
@article{arxiv.2512.05376,
title = {Scarf complexes of connected and path ideals},
author = {Trung Chau and Richie Sheng and Tim Tribone and Deborah Wooton},
journal= {arXiv preprint arXiv:2512.05376},
year = {2025}
}
Comments
19 pages, 9 figures. Fixed missing word in title