中文
相关论文

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

200 篇论文

Let $G$ be a simple graph on $n$ vertices, and let $J_G$ denotes the corresponding binomial edge ideal in $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$, where $\mathbb{K}$ is a field. We show that if a vertex satisfies a certain degree…

交换代数 · 数学 2025-12-03 Kanoy Kumar Das , Rajiv Kumar , Paramhans Kushwaha

We show that there is a constant c>0 so that for any fixed r which is at least 3 a.a.s. an r-regular graph on n vertices contains a complete graph on c n^{1/2} vertices as a minor. This confirms a conjecture of Markstrom. Since any minor of…

组合数学 · 数学 2008-03-21 N. Fountoulakis , D. Kühn , D. Osthus

We consider the following question concerning the equality of ordinary and symbolic powers of ideals. In a regular local ring, if the ordinary and symbolic powers of a one-dimensional prime ideal are the same up to its height, then are they…

交换代数 · 数学 2013-04-23 Aline Hosry , Youngsu Kim , Javid Validashti

Assume that $G$ is a graph with edge ideal $I(G)$ and matching number ${\rm match}(G)$. For every integer $s\geq 1$, we denote the $s$-th squarefree power of $I(G)$ by $I(G)^{[s]}$. It is shown that for every positive integer $s\leq {\rm…

交换代数 · 数学 2022-07-19 S. A. Seyed Fakhari

The famous P\'{o}sa-Seymour conjecture, confirmed in 1998 by Koml\'{o}s, S\'{a}rk\"{o}zy, and Szemer\'{e}di, states that for any $k \geq 2$, every graph on $n$ vertices with minimum degree $kn/(k + 1)$ contains the $k$-th power of a…

组合数学 · 数学 2018-08-31 Nemanja Škorić , Angelika Steger , Miloš Trujić

We prove that if $G$ is a $k$-partite graph on $n$ vertices in which all of the parts have order at most $n/r$ and every vertex is adjacent to at least a $1-1/r+o(1)$ proportion of the vertices in every other part, then $G$ contains the…

组合数学 · 数学 2022-03-04 Louis DeBiasio , Ryan Martin , Theodore Molla

We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…

组合数学 · 数学 2019-11-05 Primož Potočnik , Janoš Vidali

In this paper we study ideals of points lying on rational normal curves defined in projective plane and projective $ 3 $-space. We give an explicit formula for the value of Castelnuovo-Mumford regularity for their ordinary powers. Moreover,…

代数几何 · 数学 2020-07-20 Iman Bahmani Jafarloo , Grzegorz Malara

Given a real $\mu\geq 1$, a graph $H$ is $\mu$-almost-regular if $\Delta(H)\leq \mu \delta(H)$. The celebrated regularization theorem of Erd\H{o}s and Simonovits states that for every real $0<\varepsilon<1$ there exists a real…

组合数学 · 数学 2025-07-17 Tao Jiang , Sean Longbrake

For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…

交换代数 · 数学 2020-03-17 Giuseppe Favacchio , Graham Keiper , Adam Van Tuyl

Let $I=I(D)$ be the edge ideal of a weighted oriented graph $D$, let $G$ be the underlying graph of $D$, and let $I^{(n)}$ be the $n$-th symbolic power of $I$ defined using the minimal primes of $I$. We prove that $I^2=I^{(2)}$ if and only…

交换代数 · 数学 2024-03-11 Gonzalo Grisalde , Jose Martinez-Bernal , Rafael H. Villarreal

In this article, we discuss when one can extend an r-regular graph to an r + 1 regular by adding edges. Different conditions on the num- ber of vertices n and regularity r are developed. We derive an upper bound of r, depending on n, for…

组合数学 · 数学 2015-09-21 Anirban Banerjee , Saptarshi Bej

We explicitly compute the least degree of generators of all symbolic powers of the defining ideal of Fermat-like configuration of lines in $\mathbb{P}^3_\mathbb{C}$, except for the second symbolic powers, where we provide bounds for them.…

交换代数 · 数学 2022-06-23 Thái Thành Nguyên

We give explicit criteria that imply the resurgence of a self-radical ideal in a regular ring is strictly smaller than its codimension, which in turn implies that the stable version of Harbourne's conjecture holds for such ideals. This…

交换代数 · 数学 2020-04-29 Eloísa Grifo , Craig Huneke , Vivek Mukundan

An $r$-uniform linear cycle of length $\ell$, denoted by $C^r_{\ell}$, is an $r$-graph with $\ell$ edges $e_1,e_2,\dots,e_{\ell}$ where $e_i=\{v_{(r-1)(i-1)},v_{(r-1)(i-1)+1},\dots,v_{(r-1)i}\}$ (here $v_0=v_{(r-1)\ell}$). For $0<\delta<1$…

组合数学 · 数学 2025-04-10 Lirong Deng , Jie Han , Jiaxi Nie , Sam Spiro

We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let $G$ be a unicyclic graph with a unique odd cycle and $I=I(G)$ be its edge ideal. We compute the exact values of all symbolic defects of $I$ using the…

交换代数 · 数学 2022-04-13 Mousumi Mandal , Dipak Kumar Pradhan

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…

交换代数 · 数学 2014-06-03 Arindam Banerjee

In this paper we generalize the theorem of Ein-Lazarsfeld-Smith (concerning the behavior of symbolic powers of prime ideals in regular rings finitely generated over a field of characteristic 0) to arbitrary regular rings containing a field.…

交换代数 · 数学 2009-11-07 Melvin Hochster , Craig Huneke

A seminal result by Koml\'os, Sark\"ozy, and Szemer\'edi states that if a graph $G$ with $n$ vertices has minimum degree at least $kn/(k + 1)$, for some $k \in \mathbb{N}$ and $n$ sufficiently large, then it contains the $k$-th power of a…

组合数学 · 数学 2021-08-12 Rajko Nenadov , Miloš Trujić

This paper deals with the problem of graph matching or network alignment for Erd\H{o}s--R\'enyi graphs, which can be viewed as a noisy average-case version of the graph isomorphism problem. Let $G$ and $G'$ be $G(n, p)$ Erd\H{o}s--R\'enyi…

统计理论 · 数学 2022-07-08 Cheng Mao , Mark Rudelson , Konstantin Tikhomirov