Papers
Topics
Authors
Recent
Search
2000 character limit reached

Betti numbers of split graphs

Published 2 Jun 2026 in math.AC | (2606.03101v1)

Abstract: 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 $β{0,0}$ and $β{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 all $y_i$ are neighbors to all $x_j$, except that $y_i$ is not a neighbor to $x_i$ for $i=1,\ldots,\min{m,n}$). We also determine which split graphs that have Cohen-Macaulay edge ring.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.