Lattice points arising from regularity and v-number of Graphs: Whisker and Cameron-Walker
Abstract
Let G be a simple graph on n vertices and I(G)⊂eq R be its edge ideal. In this paper, we initiate the study of determining lattice points in N2 that appear as a pair (reg(R/I(G)), v(I(G))), where G ranges over all connected graphs on n vertices, and we denote this set by RV(n). Here `reg' denotes the (Castelnuovo-Mumford) regularity and `v' denotes the v-number. We establish general bounds for RV(n) by identifying two sets A(n) and B(n) satisfying A(n)⊂eq RV(n)⊂eq B(n). Furthermore, we explicitly determine the subsets of RV(n) consisting of all possible pairs (reg(R/I(G)), v(I(G))) arising from whisker graphs and Cameron-Walker graphs on n vertices. Finally, we propose a conjecture on the subset of RV(n) arising from connected chordal graphs.
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.