English
Related papers

Related papers: Regularity and $a$-invariant of Cameron--Walker gr…

200 papers

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$ is the graph whose vertices correspond to the $i(G)$-sets, and where two…

Combinatorics · Mathematics 2023-05-30 Richard Brewster , Kieka Mynhardt , Laura Teshima

A graph is well-covered if all its maximal independent sets are of the same cardinality (Plummer, 1970). If G is a well-covered graph, has at least two vertices, and G-v is well-covered for every vertex v, then G is a 1-well-covered graph…

Combinatorics · Mathematics 2016-12-13 Vadim E. Levit , Eugen Mandrescu

Settling Kahn's conjecture (2001), we prove the following upper bound on the number $i(G)$ of independent sets in a graph $G$ without isolated vertices: \[ i(G) \le \prod_{uv \in E(G)} i(K_{d_u,d_v})^{1/(d_u d_v)}, \] where $d_u$ is the…

Combinatorics · Mathematics 2019-08-19 Ashwin Sah , Mehtaab Sawhney , David Stoner , Yufei Zhao

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Group Theory · Mathematics 2021-05-27 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

The $\mathrm{v}$-number of a graded ideal $I\subseteq R$, denoted by $\mathrm{v}(I)$, is the minimum degree of a polynomial $f$ for which $I:f$ is a prime ideal. Jaramillo and Villarreal (J Combin Theory Ser A 177:105310, 2021) studied the…

Commutative Algebra · Mathematics 2023-08-22 Kamalesh Saha

Given integers $r$ and $b$ with $1 \leq b \leq r$, a finite simple connected graph $G$ for which ${\rm reg}(S/I(G)) = r$ and the number of extremal Betti numbers of $S/I(G)$ is equal to $b$ will be constructed.

Commutative Algebra · Mathematics 2019-03-18 Takayuki Hibi , Kyouko Kimura , Kazunori Matsuda

We say that a (di)graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. The seminal Hajnal--Szemer\'edi theorem characterises the minimum degree that ensures a graph…

Combinatorics · Mathematics 2015-01-27 Andrew Treglown

Let $G$ denote a near-polygon distance-regular graph with diameter $d\geq 3$, valency $k$ and intersection numbers $a_1>0$, $c_2>1$. Let $\theta_1$ denote the second largest eigenvalue for the adjacency matrix of $G$. We show $\theta_1$ is…

Combinatorics · Mathematics 2007-05-23 Paul Terwilliger , Chih-wen Weng

We prove that $\beta_p(I(G)) = \beta_{p,p+r}(I(G))$ for skew Ferrers graph $G$, where $p:=\pd(I(G))$ and $r:=\reg(I(G))$. As a consequence, we confirm that Ene, Herzog and Hibi's conjecture is true for the Betti numbers in the last columm…

Commutative Algebra · Mathematics 2018-06-07 Do Trong Hoang

Let $I$ be a two-dimensional squarefree monomial ideal of a polynomial ring $S$. We evaluate the geometric regularity, $a_i$-invariants for $i\geq 1$ of the power $I^n$. It turns out they are all linear functions in $n$ from $n=2$.…

Commutative Algebra · Mathematics 2020-02-20 Dancheng Lu

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue…

Spectral Theory · Mathematics 2014-01-10 Polona Oblak , Helena Šmigoc

The regularity of an edge ideal of a finite simple graph $G$ is at least the induced matching number of $G$ and is at most the minimum matching number of $G$. If $G$ possesses a dominating inuduced matching, i.e., an induced matching which…

Combinatorics · Mathematics 2015-08-27 Takayuki Hibi , Akihiro Higashitani , Kyouko Kimura , Akiyoshi Tsuchiya

Let $S$ be a polynomial ring in $n$ variables over a field. Let $I$ be a homogeneous ideal in $S$ generated by forms of degree at most $d$ with $\text{dim}(S/I)=r$. In the first part of this paper, we show how to derive from a result of Hoa…

Commutative Algebra · Mathematics 2022-04-20 Yihui Liang

Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as…

Commutative Algebra · Mathematics 2019-10-07 Arvind Kumar , Rajib Sarkar

We prove that the algebraic connectivity a(G) of a graph embedded on a nonplanar surface satisfies a Heawood-type result. More precisely, it is shown that the algebraic connectivity of a surface S, defined as the supremum of a(G) over all…

Combinatorics · Mathematics 2007-05-23 Pedro Freitas

Let $A$ be a regular domain containing a field $K$ of characteristic zero, $G$ be a finite subgroup of the group of automorphisms of $A$ and $B=A^G$ be the ring of invariants of $G$. Let $S= A[X_1,\ldots, X_m]$ and $R= B[X_1, \ldots, X_m]$…

Commutative Algebra · Mathematics 2017-09-29 Tony J. Puthenpurakal , Sudeshna Roy

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal in a polynomial ring over a field $\mathbb{K}$. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of symbolic powers of certain…

Commutative Algebra · Mathematics 2021-08-20 Arvind Kumar , S Selvaraja

We investigate the \textit{group irregularity strength}, $s_g(G)$, of a graph, i.e. the least integer $k$ such that taking any Abelian group $\mathcal{G}$ of order $k$, there exists a function $f:E(G)\rightarrow \mathcal{G}$ so that the…

Combinatorics · Mathematics 2018-10-16 Marcin Anholcer , Sylwia Cichacz , Jakub Przybyło

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a…

Commutative Algebra · Mathematics 2007-06-13 Huy Tai Ha , Adam Van Tuyl

The notion of walk entropy $S^V(G,\beta)$ for a graph $G$ at the inverse temperature $\beta$ was put forward recently by Estrada et al. (2014) \cite{6}. It was further proved by Benzi \cite{1} that a graph is walk-regular if and only if its…

Mathematical Physics · Physics 2019-02-05 Ernesto Estrada , Jose A. de la Pena