相关论文: Regularity of symbolic powers of certain graphs

We show that the Conjecture of Harbourne and Huneke, $I^{(Nr-(N-1))} \subset M^{(r-1)(N-1)}I^{r}$ holds for ideals of generic (simple) points in $\PP^3$. As a result, for such ideals we prove the following bounds, which can be recognized as…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

A fruitful contemporary paradigm in graph theory is that almost all graphs that do not contain a certain subgraph have common structural characteristics. The "almost" is crucial, without it there is no structure. In this paper we transfer…

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…

A graph G = (V,E) is called fully regular if for every independent set $I\subset V$ , the number of vertices in $V\setminus$ I that are not connected to any element of I depends only on the size of I. A linear ordering of the vertices of G…

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. This note is about the energy of regular graphs. It is shown that graphs that are close to regular can be made regular with a negligible…

This is the fifth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

In this article, we carry out the investigation for regular sequences of symmetric polynomials in the polynomial ring in three and four variable. Any two power sum element in $\mathbb{C}[x_1,x_2,...,x_n]$ for $n \geq 3$ always form a…

We classify all unicycle graphs whose edge-binomials form a $d$-sequence, particularly linear type binomial edge ideals. We also classify unicycle graphs whose parity edge-binomials form a $d$-sequence. We study the regularity of powers of…

Denote by $R(G_1, G_2, G_3)$ the minimum integer $N$ such that any three-colouring of the edges of the complete graph on $N$ vertices contains a monochromatic copy of a graph $G_i$ coloured with colour $i$ for some $i\in{1,2,3}$. In a…

In 1996, in his last paper, Erd\H{o}s asked the following question that he formulated together with Faudree: is there a positive $c$ such that any $(n+1)$-regular graph $G$ on $2n$ vertices contains at least $c 2^{2n}$ distinct…

We prove that every properly edge-colored $n$-vertex graph with average degree at least $100(\log n)^2$ contains a rainbow cycle, improving upon $(\log n)^{2+o(1)}$ bound due to Tomon. We also prove that every properly colored $n$-vertex…

Denote by $R(G_1, G_2, G_3)$ the minimum integer $N$ such that any three-colouring of the edges of the complete graph on $N$ vertices contains a monochromatic copy of a graph $G_i$ coloured with colour $i$ for some $i\in{1,2,3}$. In a…

Let $I(G)$ be the edge ideal of a simple graph $G$ over a field k. We prove that $${\rm reg}(\overline {I(G)^s}) = {\rm reg}(I(G)^s),$$ for all $s \le 4$. Furthermore, we provide an example of a graph $G$ such that $${\rm reg} I(G)^s = {\rm…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Let $G$ be a graph with $n$ vertices. Assume that $I=I(G)$ is the edge ideal of $G$ and $J=J(G)$ is its cover ideal. We…

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

Let $G$ be a finite group and $\mathrm{Irr}(G)$ be the set of all complex irreducible characters of $G$. The character-graph $\Delta(G)$ associated to $G$, is a graph whose vertex set is the set of primes which divide the degrees of some…

Recent work of Ein-Lazarsfeld-Smith and Hochster-Huneke raised the problem of which symbolic powers of an ideal are contained in a given ordinary power of the ideal. Bocci-Harbourne developed methods to address this problem, which involve…

Let $G$ be a graph obtained as the union of some $n$-vertex graph $H_n$ with minimum degree $\delta(H_n)\geq\alpha n$ and a $d$-dimensional random geometric graph $G^d(n,r)$. We investigate under which conditions for $r$ the graph $G$ will…

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…