The v-number and Castelnuovo-Mumford regularity of graphs
Abstract
We prove that for every integer k≥ 1, there exists a connected graph Hk such that v(Hk)=reg(Hk)+k, where v(G) and reg(G) denote the v-number and the (Castelnuovo-Mumford) regularity of a graph G respectively.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.