Related papers: Stanley depth and complete $k$-partite hypergraphs

Suppose $G$ is a $k$-uniform hypergraph on $n$ vertices such that every $(k-1)$-subset $S$ of $V(G)$ belongs to at least $\delta n$ edges, where $\delta> 1/2$. Let $\Psi(G)$ denote the number of tight Hamilton cycles in $G$, that is, cyclic…

The log-density method is a powerful algorithmic framework which in recent years has given rise to the best-known approximations for a variety of problems, including Densest-$k$-Subgraph and Bipartite Small Set Vertex Expansion. These…

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…

Let $I$ be the edge ideal of a cycle of length $n \ge 5$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_n]$. We prove that for $2 \le t < \lceil (n+1)/2 \rceil$, $$\operatorname{depth} (S/I^t) = \lceil \frac{n -t + 1}{3} \rceil.$$ When…

The "edge polytope" of a finite graph G is the convex hull of the columns of its vertex-edge incidence matrix. We study extremal problems for this class of polytopes. For k =2, 3, 5 we determine the maximum number of vertices of…

Let $H=(V,E)$ be an $s$-uniform hypergraph of order $n$ and $k\geq 0$ be an integer. A $k$-independent set $S\subseteq H$ is a set of vertices such that the maximum degree in the hypergraph induced by $S$ is at most $k$. Denoted by…

Assume that $G$ is a graph with edge ideal $I(G)$. We provide sharp lower bounds for the depth of $I(G)^2$ in terms of the star packing number of $G$.

In this note, we determine the maximum number of edges of a $k$-uniform hypergraph, $k\ge 3$, with a unique perfect matching. This settles a conjecture proposed by Snevily.

In this short note we give an elementary description of the linear part of the minimal free resolution of a Stanley-Reisner ring of a simplicial complex $\Delta$. Indeed, the differentials in the linear part are simply a compilation of…

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…

In this paper we study the behavior of the size of a monomial ideal under polarization and under generic deformations. As an application, we extend a result relating the size and the Stanley depth of a squarefree monomial ideal obtained by…

Let K be a field and let S = K[x_1, ..., x_n] be a polynomial ring. Consider a homogenous ideal I in S. Let t_i denote reg(Tor_i (S/I, K)), the maximal degree of an ith syzygy of S/I. We prove bounds on the numbers t_i for i > n/2 purely in…

We study Stanley decompositions and show that Stanley's conjecture on Stanley decompositions implies his conjecture on partitionable Cohen-Macaulay simplicial complexes. We also prove these conjectures for all Cohen-Macaulay monomial ideals…

In 2016 Ananyan and Hochster proved Stillman's conjecture by showing the existence of a uniform upper bound for the projective dimension of all homogeneous ideals, in polynomial rings over a field, generated by n forms of degree at most d.…

Let $I$ be a squarefree monomial ideal of $S=K[x_1,\ldots,x_n]$. We prove that if $\operatorname{hdepth}(S/I)\leq 8$ or $n\leq 10$ then $\operatorname{hdepth}(I)\geq \operatorname{hdepth}(S/I)-1$.

We prove lower bounds for the fraction of edges of an $r$-graph which can be covered by the union of $k$ 1-factors. The special case $r=3$ yields some known results for cubic graphs. Furthermore, we introduce the concept of…

Given an arbitrary integer $d>0$, we construct a homogeneous ideal $I$ of the polynomial ring $S = K[x_1, \ldots, x_{3d}]$ in $3d$ variables over a filed $K$ for which $S/I$ is a Cohen--Macaulay ring of dimension $d$ with the property that,…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

We give an effective uniform bound on the multigraded regularity of a subscheme of a smooth projective toric variety X with a given multigraded Hilbert polynomial. To establish this bound, we introduce a new combinatorial tool, called a…

We recall a numerical criteria for Cohen--Macaulayness related to system of parameters, and introduce monomial ideals of K\"onig type which include the edge ideals of K\"onig graphs. We show that a monomial ideal is of K\"onig type if and…