English
Related papers

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

200 papers

In commutative invariant theory, a classical result due to Auslander says that if $R = \Bbbk[x_1, \dots, x_n]$ and $G$ is a finite subgroup of $\text{Aut}_{\text{gr}}(R) \cong \text{GL}(n,\Bbbk)$ which contains no reflections, then there is…

Rings and Algebras · Mathematics 2019-10-31 Simon Crawford

The maximum average degree $\mathrm{mad}(G)$ of a graph $G$ is the maximum average degree over all subgraphs of $G$. In this paper we prove that for every $G$ and positive integer $k$ such that $\mathrm{mad}(G) \ge k$ there exists $S…

Discrete Mathematics · Computer Science 2020-03-24 Wojciech Nadara , Marcin Smulewicz

Let $G$ be a $k$-degenerate graph of order $n.$ It is well-known that $G\ $has no more edges than $S_{n,k},$ the join of a complete graph of order $k$ and an independent set of order $n-k.$ In this note it is shown that $S_{n,k}$ is…

Combinatorics · Mathematics 2014-03-25 V. Nikiforov

Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal…

Commutative Algebra · Mathematics 2016-05-24 Jennifer Biermann , Augustine O'Keefe , Adam Van Tuyl

A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that…

Combinatorics · Mathematics 2012-10-23 M. Cámara , C. Dalfó , C. Delorme , M. A. Fiol , H. Suzuki

Assume that $G$ is a graph with edge ideal $I(G)$ and star packing number $\alpha_2(G)$. We denote the $s$-th symbolic power of $I(G)$ by $I(G)^{(s)}$. It is shown that the inequality ${\rm depth} S/(I(G)^{(s)})\geq \alpha_2(G)-s+1$ is true…

Commutative Algebra · Mathematics 2020-09-30 S. A. Seyed Fakhari

In this paper, we characterize all graphs $G$ satisfying \[\operatorname{reg}(S/J_G)=\ell(G)=c(G)\] where $\ell(G)$ is the sum of the lengths of the longest induced paths in each connected component of $G$ and $c(G)$ is the number of the…

Commutative Algebra · Mathematics 2026-02-09 Nursel Erey , Muhammed Ergen , Takayuki Hibi

While standard Weisfeiler-Leman vertex labels are not able to distinguish even vertices of regular graphs, there is proposed and tested family of inexpensive polynomial time vertex and edge invariants, distinguishing much more difficult…

Computational Complexity · Computer Science 2024-02-08 Jarek Duda

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…

Combinatorics · Mathematics 2024-10-04 Wei Wang , Wei Wang , Fuhai Zhu

Let $G$ be a simple graph on $n$ vertices and $J_G$ denote the binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we compute the second graded Betti numbers of $J_G$, and…

Commutative Algebra · Mathematics 2020-10-22 A. V. Jayanthan , Arvind Kumar , Rajib Sarkar

Let $G$ be a finite simple graph on the vertex set $V(G)$ and let $r$ be a positive integer. We consider the hypergraph $\mathrm{Con}_r(G)$ whose vertices are the vertices of $G$ and the (hyper)edges are all $A\subseteq V(G)$ such that…

Commutative Algebra · Mathematics 2025-09-17 Sourav Kanti Patra , Amit Roy

Let $G$ be a graph with degree sequence $d_1\geq \ldots \geq d_n$. Slater proposed $s\ell(G)=\min\{ s: (d_1+1)+\cdots+(d_s+1)\geq n\}$ as a lower bound on the domination number $\gamma(G)$ of $G$. We show that deciding the equality of…

Combinatorics · Mathematics 2016-08-17 Michael Gentner , Dieter Rautenbach

We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also…

Combinatorics · Mathematics 2022-11-30 Peter Allen , Julia Böttcher

Let $G$ be a bipartite graph and $I=I(G)$ be its edge ideal. The aim of this note is to investigate different aspects of the Rees algebra $\mathcal{R}(I)$ of $I$. We compute its regularity and the universal Gr\"obner basis of its defining…

Commutative Algebra · Mathematics 2018-05-10 Yairon Cid-Ruiz

Let $G$ be a finite simple graph on $n$ vertices. Let $J_G \subset K[x_1, \ldots, x_n]$ be the cover ideal of $G$. In this article, we obtain syzygies, Betti numbers and Castelnuovo-Mumford regularity of $J_G^s$ for all $s \geq 1$ for…

Commutative Algebra · Mathematics 2019-10-21 A V Jayanthan , Neeraj Kumar

The codegree ${\rm codeg}(\mathcal{P})$ of a lattice polytope $\mathcal{P}$ is a fundamental invariant in discrete geometry. In the present paper, we investigate the codegree of the stable set polytope $\mathcal{P}_G$ associated with a…

Combinatorics · Mathematics 2026-04-01 Koji Matsushita , Akiyoshi Tsuchiya

Let $n\ge 1$ be an integer and $\mathbb{F}_q$ be a finite field of characteristic $p$ with $q$ elements. In this paper, it is proved that the Wenger graph $W_n(q)$ and linearized Wenger graph $L_m(q)$ are edge-girth-regular…

Combinatorics · Mathematics 2023-11-09 Fuyuan Yang , Qiang Sun , Chao Zhang

The $h$-vectors of homogeneous rings are one of the most important invariants that often reflect ring-theoretic properties. On the other hand, there are few examples of edge rings of graphs whose $h$-vectors are explicitly computed. In this…

Commutative Algebra · Mathematics 2022-07-14 Akihiro Higashitani , Nayana Shibu Deepthi

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…

Combinatorics · Mathematics 2022-08-16 Magda Dettlaff , Michael A. Henning , Jerzy Topp

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

Commutative Algebra · Mathematics 2025-02-05 Takayuki Hibi , Seyed Amin Seyed Fakhari
‹ Prev 1 4 5 6 7 8 10 Next ›