The $v$-number and Castelnuovo-Mumford regularity of graphs

We prove that for every integer $k \geq 1$ , there exists a connected graph $H_{k}$ such that $v (H_{k}) = r e g (H_{k}) + k$ , where $v (G)$ and $r e g (G)$ denote the $v$ -number and the (Castelnuovo-Mumford) regularity of a graph $G$ respectively.

The $v$ -number and Castelnuovo-Mumford regularity of graphs

文献摘要

讨论

讲解博客

AI智能校验

The $v$ -number and Castelnuovo-Mumford regularity of graphs

文献摘要

讨论

讲解博客

AI智能校验

The vv-number and Castelnuovo-Mumford regularity of graphs

文献摘要

讨论

|讲解博客

|AI智能校验

The vv-number and Castelnuovo-Mumford regularity of graphs

文献摘要

讨论

|讲解博客

|AI智能校验

The $v$ -number and Castelnuovo-Mumford regularity of graphs

讲解博客

AI智能校验

The $v$ -number and Castelnuovo-Mumford regularity of graphs

讲解博客

AI智能校验