Linear quotients of connected ideals of graphs
Abstract
As a higher analogue of the edge ideal of a graph, we study the t-connected ideal Jt. This is the monomial ideal generated by the connected subsets of size t. For chordal graphs, we show that Jt has a linear resolution iff the tree is t-gap-free, and that this is equivalent to having linear quotients. We then show that if G is any gap-free and t-claw-free graph, then Jt(G) has linear quotients and, hence, linear resolution.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.