Skip to content
DraconiticResearch
Search Sources API
190,839 studies31 sourcesUpdated 27 min ago
PreprintarXiv licencearXiv

Linear resolutions of powers of edge ideals of gap-free graphs with matching number four

Abstract

For a finite simple gap-free graph G, let B(G) denote the vertices v for which G−NG[v] is not co-chordal, and put C(G)=V(G)∖ B(G). We prove a sufficient condition for all ordinary powers of its edge ideal to have linear resolutions from the second power onward: every induced anticycle of length at least five must contain an edge with both endpoints in C(G). The argument uses variable generators of augmented colon ideals to eliminate anticycles that may persist in the ordinary quadratic colons. It yields linear resolutions for all powers I(G)q, q≥2, whenever the ordinary matching number is at most four, which answers the first part of a question of Erey, Hà, Hibi, Kara and Morey. The criterion also applies to certain graphs with adjacent exceptional vertices and matching number five. The proofs are theoretical and valid over arbitrary fields. We do not assert linear quotients.

Related

  1. Stabilization index of V-number of powers of edge ideals of graphs
    Ha Thi Thu Hien, Thanh Vu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. v-numbers of powers of edge ideals of cubic circulant graphs
    Guangjun Zhu, Jiaxin Li, Yulin Hu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. Edge ideals of gapfree graphs with matching number $3$
    Nursel Erey, Tài Huy Hà, Takayuki Hibi +2
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  4. Minimal cellular resolutions of complementary edge ideals
    Somayeh Moradi
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. Minimal Resolutions of k-divisible and (k−1)-dominant Ideals
    Patrick Welte, Guillermo Alesandroni
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{garcia2026linear,
  title = {{Linear resolutions of powers of edge ideals of gap-free graphs with matching number four}},
  author = {Luis Alfredo Dupont García},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.00961},
  eprint = {2611.00961},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.00961},
}
RIS
TY  - UNPB
TI  - Linear resolutions of powers of edge ideals of gap-free graphs with matching number four
AU  - Luis Alfredo Dupont García
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.00961
UR  - https://arxiv.org/abs/2611.00961
AB  - For a finite simple gap-free graph G, let B(G) denote the vertices v for which G−N_G[v] is not co-chordal, and put C(G)=V(G)∖ B(G). We prove a sufficient condition for all ordinary powers of its edge ideal to have linear resolutions from the second power onward: every induced anticycle of length at least five must contain an edge with both endpoints in C(G). The argument uses variable generators of augmented colon ideals to eliminate anticycles that may persist in the ordinary quadratic colons. It yields linear resolutions for all powers I(G)^q, q≥2, whenever the ordinary matching number is at most four, which answers the first part of a question of Erey, Hà, Hibi, Kara and Morey. The criterion also applies to certain graphs with adjacent exceptional vertices and matching number five. The proofs are theoretical and valid over arbitrary fields. We do not assert linear quotients.
ER  -