相关论文: Edge ideals with almost maximal finite index and t…

For a graph $G=(V,E)$ the edge ring $k[G]$ is $k[x_1,\ldots,x_n]/I(G)$, where $n=|V|$ and $I(G)$ is generated by $\{ x_ix_j;\{ i,j\}\in E\}$. The conjecture we treat is the following. If $k[G]$ has a 2-linear resolution, then the projective…

In this dissertation, we tackle the problem of describing the equations of the Rees algebra of I for I =(J,y), with J being of linear type. Throughout, such ideals are referred to as ideals of almost-linear type. In Theorem A, we give a…

We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…

We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…

A drawing of a graph in the plane is a thrackle if every pair of edges intersects exactly once, either at a common vertex or at a proper crossing. Conway's conjecture states that a thrackle has at most as many edges as vertices. In this…

We describe all the trees with the property that the corresponding edge ideal of the square of the tree has a linear resolution. As a consequence, we give a complete characterization of those trees $T$ for which the square is co-chordal,…

Let $G$ be a finite graph and $K[G]$ the edge ring of $G$. Based on the technique of Gr\"obner bases and initial ideals, it will be proved that, given integers $f$ and $d$ with $7 \leq f \leq d$, there exists a finite graph $G$ on…

In this paper we prove the existence of a special order on the set of minimal monomial generators of powers of edge ideals of arbitrary graphs. Using this order we find new upper bounds on the regularity of powers of edge ideals of graphs…

In this paper we give upper bounds for the regularity of edge ideal of some classes of graphs in terms of invariants of graph. We introduce two numbers $a'(G)$ and $n(G)$ depending on graph $G$ and show that for a vertex decomposable graph…

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $f$ be a 0-1 labeling of $E(G)$ so that the absolute difference in the number of edges labeled 1 and 0 is no more than one. Call such a labeling $f$ \emph{edge-friendly}.…

Ohsugi and Hibi characterized the edge ring of a finite connected simple graph with a $2$-linear resolution. On the other hand, Hibi, Matsuda and the author conjectured that the edge ring of a finite connected simple graph with a $q$-linear…

Let $G$ be a simple finite graph. A famous theorem of Dirac says that $G$ is chordal if and only if $G$ admits a perfect elimination order. It is known by Fr\"oberg that the edge ideal $I(G)$ of $G$ has a linear resolution if and only if…

In this paper, we define (im, reg)-invariant extension of graphs and propose a new approach for Nevo and Peeva's conjecture which said that for any gap-free graph $G$ with $reg(I(G)) = 3$ and for any $k \geq 2$, $I(G)^k$ has a linear…

In this paper we provide a full combinatorial characterization of sequentially Cohen-Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen-Macaulay if and…

We determine the maximum number of edges in a $K_4$-minor-free $n$-vertex graph of girth $g$, when $g = 5$ or $g$ is even. We argue that there are many different $n$-vertex extremal graphs, if $n$ is even and $g$ is odd.

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…

A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on…

Let $G$ be a finite graph on the vertex set $[d] = \{1, ..., d \}$ with the edges $e_1, ..., e_n$ and $K[\tb] = K[t_1, ..., t_d]$ the polynomial ring in $d$ variables over a field $K$. The edge ring of $G$ is the semigroup ring $K[G]$ which…

Let $R$ be a commutative ring with unity. The essential ideal graph $\mathcal{E}_{R}$ of $R$, is a graph with a vertex set consisting of all nonzero proper ideals of \textit{R} and two vertices $I$ and $K$ are adjacent if and only if $I+ K$…

Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…