arXiv (All)
open access
Edge ideals of gapfree graphs with matching number $3$
We prove that if $G$ is a gapfree graph with matching number $3$, then every power $I(G)^q$, $q\geq2$, of its edge ideal has linear quotients, and hence a linear resolution. Our approach combines graph reductions based on clique domination of gapfree graphs and matching number with operations preser
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
- Proper edge colorings of planar graphs with rainbow $C_4$-s#793392
- Proper edge colorings of planar graphs with rainbow $C_4$-s#789388
- Matching complements in subcubic graphs and a proof of the 3-Decomposition Conjecture#926194
- An improved lower bound for the van der Waerden number $w(3,k)$#1115754
Record · ID 1357521
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive