Castelnuovo-Mumford regularity of graphs
Turker Biyikoglu, Yusuf Civan
TL;DR
This paper introduces new combinatorial methods for calculating the Castelnuovo-Mumford regularity of graphs, enhancing understanding of their algebraic properties.
Contribution
It provides novel combinatorial insights that improve the calculation and understanding of the regularity of graphs.
Findings
New combinatorial formulas for regularity
Improved bounds on regularity values
Enhanced understanding of graph algebraic properties
Abstract
We present new combinatorial insights into the calculation of (Castelnuovo-Mumford) regularity of graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.