{"paper":{"title":"Betti numbers of split graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Ralf Fr\\\"oberg","submitted_at":"2026-06-02T03:39:24Z","abstract_excerpt":"A split graph is a graph where the vertices are a disjoint union of a complete part $C=\\{x_i,\\ldots,x_n\\}$ and a stable part $S=\\{y_1,\\ldots,y_m\\}$. We will determine the Betti numbers of the edge ring of all split graphs, in particular show that the only nonzero Betti numbers are $\\beta_{0,0}$ and $\\beta_{i,i+1}$, $i>0$. The Betti numbers only depend on the multiset of the number of neighbors in $S$ the $x_i$'s have. Singh and Verma have earlier determined the Betti numbers for complete split graphs (where all $y_i$ are neighbors to all $x_j$), and for \"nearly complete\" split graphs (where al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03101","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.03101/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}