Related papers: Initially Regular Sequences on Cycles and Depth of…

In this paper we explore certain properties of the Rees algebra of $I_t(C_n)$, the $t$-path ideal of an $n$-cycle. Our main focus is on the cases when such ideals are of fiber type.

In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then, we introduce the concepts of the inner diameter and inner radius of a digraph and study…

Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart that every $n$-vertex graph $G$ with at least $\frac52(n-1)$…

We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials…

A homogeneous set of an $n$-vertex graph is a set $X$ of vertices ($2\le |X|\le n-1$) such that every vertex not in $X$ is either complete or anticomplete to $X$. A graph is called prime if it has no homogeneous set. A chain of length $t$…

We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of…

This paper leverages the framework of algorithms-with-predictions to design data structures for two fundamental dynamic graph problems: incremental topological ordering and cycle detection. In these problems, the input is a directed graph…

In a recent work, Fouli and Lin generalized a Villarreal's result and showed that if each connected components of the line graph of a squarefree monomial ideal contains at most a unique odd cycle, then this ideal is of linear type. In this…

Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is…

We study the discrete graph-metric analogue of Gromov's filling area problem for the cycle graph \(C_n\). An abstract triangulation \(K\) is an isometric filling of \(C_n\) if \(\partial K=C_n\) and the graph distance between any two…

The v-number of a graded ideal is an invariant recently introduced in the context of coding theory, particularly in the study of Reed--Muller-type codes. In this work, we study the localized v-numbers of a binomial edge ideal $J_G$…

We introduce \textit{basic inequalities} for first-order iterative optimization algorithms, forming a simple and versatile framework that connects implicit and explicit regularization. While related inequalities appear in the literature, we…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

We study the existence of real-analytic first integrals and real-analytic integrability for perturbations of integrable systems in the sense of Bogoyavlenskij including non-Hamiltonian ones. We especially assume that there exists a family…

We consider the problem of incremental cycle detection and topological ordering in a directed graph $G = (V, E)$ with $|V| = n$ nodes. In this setting, initially the edge-set $E$ of the graph is empty. Subsequently, at each time-step an…

We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…

We show that every 3-uniform hypergraph with minimum vertex degree at least $0.8\binom{n-1}{2}$ contains a tight Hamiltonian cycle.

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…

Let $I$ be a monomial squarefree ideal of a polynomial ring $S$ over a field $K$ such that the sum of every three different of its minimal prime ideals is the maximal ideal of $S$, or more general a constant ideal. We associate to $I$ a…

We determine in an explicit way the depth of the fiber cone and its relation ideal for classes of monomial ideals in two variables. These classes include concave and convex ideals as well as symmetric ideals.