paper

Scarf complexes of connected and path ideals

arXiv:2512.05376

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 .

19 pages, 9 figures. Fixed missing word in title

Scarf complexes of connected and path ideals · wovepaper