arXiv (All)
open access
A DG algebra structure for the edge ideal of any split graph
We construct an explicit DG algebra structure on the minimal free resolution of the quotient of a polynomial ring by the edge ideal of any split graph (that is, a graph whose vertex set is a disjoint union of a clique and an independent set). The algebra structure is based on a simple combinatorial
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
- Regularity, depth and Serre depth of symbolic powers of complementary edge ideals#1387509
- Comparisons between ordinary and symbolic powers of edge ideals with respect to regularity and depth#973560
- Top-Down Lower Bounds for All Depths#1143278
- Degree sequence condition for pancyclicity in tough graphs#1048854
- Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree#1342297
Record · ID 1492148
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