arXiv (All)
open access
Characterization of Some Graphs Realizing Regularity Bounds for Binomial Edge Ideals
In this paper, we characterize all graphs $G$ satisfying \[\operatorname{reg}(S/J_G)=\ell(G)=c(G)\] where $\ell(G)$ is the sum of the lengths of the longest induced paths in each connected component of $G$ and $c(G)$ is the number of the maximal cliques of $G$. We also characterize all connected gra
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
- Stabilization index of V-number of powers of edge ideals of graphs#987968
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#799562
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#798139
- The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- An Independent Border-Free Type-A Cover of Q221 and Improved Asymptotic Bounds for Queen Domination#821546
Record · ID 1143680
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