{"title":"A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution","authors":"Nguyen Cong Minh, Thanh Vu","doi":"10.1007/s00493-023-00074-z","DOIUrl":null,"url":null,"abstract":"<p>Let <i>I</i>(<i>G</i>) be the edge ideal of a simple graph <i>G</i>. We prove that <span>\\(I(G)^2\\)</span> has a linear free resolution if and only if <i>G</i> is gap-free and <span>\\({{\\,\\textrm{reg}\\,}}I(G) \\le 3\\)</span>. Similarly, we show that <span>\\(I(G)^3\\)</span> has a linear free resolution if and only if <i>G</i> is gap-free and <span>\\({{\\,\\textrm{reg}\\,}}I(G) \\le 4\\)</span>. We deduce these characterizations by establishing a general formula for the regularity of powers of edge ideals of gap-free graphs <span>\\({{\\,\\textrm{reg}\\,}}(I(G)^s) = \\max ({{\\,\\textrm{reg}\\,}}I(G) + s-1,2s)\\)</span>, for <span>\\(s =2,3\\)</span>.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"97 30","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-023-00074-z","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Let I(G) be the edge ideal of a simple graph G. We prove that \(I(G)^2\) has a linear free resolution if and only if G is gap-free and \({{\,\textrm{reg}\,}}I(G) \le 3\). Similarly, we show that \(I(G)^3\) has a linear free resolution if and only if G is gap-free and \({{\,\textrm{reg}\,}}I(G) \le 4\). We deduce these characterizations by establishing a general formula for the regularity of powers of edge ideals of gap-free graphs \({{\,\textrm{reg}\,}}(I(G)^s) = \max ({{\,\textrm{reg}\,}}I(G) + s-1,2s)\), for \(s =2,3\).
期刊介绍:
COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are
- Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups).
- Combinatorial optimization.
- Combinatorial aspects of geometry and number theory.
- Algorithms in combinatorics and related fields.
- Computational complexity theory.
- Randomization and explicit construction in combinatorics and algorithms.