Related papers: Initially Regular Sequences on Cycles and Depth of…
Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…
We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several extremal results. In particular, we show that every nearly…
For all positive even integers $n$, graphs of order $n$ with degree sequence \begin{equation*} S_{n}:1,2,\dots,n/2,n/2,n/2+1,n/2+2,\dots,n-1 \end{equation*} naturally arose in the study of a labeling problem in \cite{IMO}. This fact…
In this paper, we are interested in the generic initial ideals of \textit{singular} projective curves with respect to the graded lexicographic order. Let $C$ be a \textit{singular} irreducible projective curve of degree $d\geq 5$ with the…
We study the Stanley depth and the Hilbert depth for $I$ and $S/I$, where $I\subset S=K[x_1,\ldots,x_N]$ is the intersection of monomial prime ideals with disjoint sets of variables. As an application, we obtain bounds for the Stanley depth…
We compute the depth and Stanley depth for the quotient ring of the path ideal of length $3$ associated to a $n$-cyclic graph, given some precise formulas for depth when $n\not\equiv 1\,(\mbox{mod}\ 4)$, tight bounds when $n\equiv…
In this paper, we determine depth spectra of all repeated-root $(\alpha+\gamma \beta)$-constacyclic codes of arbitrary lengths over a finite commutative chain ring $\mathcal{R},$ where $\alpha$ is a non-zero element of the Teichm\"{u}ller…
In the \emph{incremental cycle detection} problem arcs are added to a directed acyclic graph and the algorithm has to report if the new arc closes a cycle. One seeks to minimize the total time to process the entire sequence of arc…
In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…
We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…
A subset of vertices in a graph $G$ is considered a maximal dissociation set if it induces a subgraph with vertex degree at most 1 and it is not contained within any other dissociation sets. In this paper, it is shown that for $n\geq 3$,…
A simple and connected $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1, 2, 3,\ldots, n$, such that adjacent vertices have relatively prime labels. We will present previously…
We study closed subschemes $X$ in ${\mathbb P}^n$ of dimension one, locally defined at any point by at most $n$ equations such that the analytic spread of $I_{\mathfrak{m}}$ is at most $n$, where $I \subseteq \Bbbk[x_0, \ldots, x_n] $ is…
In this paper, we describe primary decomposition of the edge ideal of the join of some graphs in terms of that information of the edge ideal of every weighted oriented graph. Meanwhile, we also study depth and regularity of symbolic powers…
We introduce a notion of the \emph{crux} of a graph $G$, measuring the order of a smallest dense subgraph in $G$. This simple-looking notion leads to some generalisations of known results about cycles, offering an interesting paradigm of…
Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…
It is known that non-isomorphic strongly regular graphs with the same parameters must be cospectral (have the same eigenvalues). In this paper, we investigate whether the spectra of higher order Laplacians associated with these graphs can…
Strongly regular graphs are highly symmetrical and can be described fully with just a few parameters, yet the existence of many of them is still under the question. In this paper, we continue the study of the famuly of strongly regular…
Let $G$ be a graph and let $\mathrm{cl}(G)$ be the number of distinct induced cycle lengths in $G$. We show that for $c,t\in \mathbb N$, every graph $G$ that does not contain an induced subgraph isomorphic to $K_{t+1}$ or $K_{t,t}$ and…
We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…