Related papers: The EGH Conjecture and the Sperner property of com…

If ${\cal H}=(V,{\cal E})$ is a hypergraph, its edge intersection hypergraph $EI({\cal H})=(V,{\cal E}^{EI})$ has the edge set ${\cal E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in {\cal E} \ \wedge \ e_1 \neq e_2 \ \wedge \ |e_1 \cap e_2…

In this paper, we prove that the Stanley--Reisner ideal of any connected simplicial complex of dimension $\ge 2$ that is locally complete intersection is a complete intersection ideal. As an application, we show that the Stanley--Reisner…

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

A graph is "$H$-free" if it has no induced subgraph isomorphic to $H$. A conjecture of Conlon, Fox and Sudakov states that for every graph $H$, there exists $s>0$ such that in every $H$-free graph with $n>1$ vertices, either some vertex has…

In this paper we give conditions on a homogeneous polynomial for which the associated graded Artin algebra is a complete intersection.

A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…

Dirac's theorem states that any $n$-vertex graph $G$ with even integer $n$ satisfying $\delta(G) \geq n/2$ contains a perfect matching. We generalize this to $k$-uniform linear hypergraphs by proving the following. Any $n$-vertex…

Let $H$ be a $3$-partite $3$-uniform hypergraph, i.e. a $3$-uniform hypergraph such that every edge intersects every partition class in exactly one vertex, with each partition class of size $n$. We determine a Dirac-type vertex degree…

Property $(P)$, introduced in recent work and rooted in the classical theory of Parter vertices, concerns the existence of a nonsingular matrix $A\in S(G)$ for which every vertex of $G$ is a $P$-vertex. Previous investigations have fully…

We prove that a homogeneous 0-dimensional complete intersection satisfies the Strong Lefschetz Property (SLP) in degree 1 if and only if its associated form has nonzero Hessian. The result is essentially known in the literature, but our…

Hadwiger's conjecture asserts that if a simple graph $G$ has no $K_{t+1}$ minor, then its vertex set $V(G)$ can be partitioned into $t$ stable sets. This is still open, but we prove under the same hypotheses that $V(G)$ can be partitioned…

We consider an entangled two-particle state that is produced from two independent down-conversion sources by the process of "entanglement-swapping", so that the particles have never met. We prove a Greenberger-Horne-Zeilinger (GHZ) type…

Let $n, s$ be positive integers such that $n$ is sufficiently large and $s\le n/3$. Suppose $H$ is a 3-uniform hypergraph of order $n$. If $H$ contains no isolated vertex and $deg(u)+ deg(v) > 2(s-1)(n-1)$ for any two vertices $u$ and $v$…

A perfect matching in a 3-uniform hypergraph on $n=3k$ vertices is a subset of $\frac{n}{3}$ disjoint edges. We prove that if $H$ is a 3-uniform hypergraph on $n=3k$ vertices such that every vertex belongs to at least ${n-1\choose 2} -…

Let $ e_1, ..., e_c $ be positive integers and let $ Y \subseteq \mathbb{P}^n$ be the monomial complete intersection defined by the vanishing of $x_1^{e_1}, ..., x_c^{e_c}$. In this paper we study sharp upper bounds on the number of…

A graph $G$ is said to be \emph{determined by its spectrum} if any graph having the same spectrum as $G$ is isomorphic to $G$. Let $K_n \setminus P_{\ell}$ be the graph obtained from $K_n$ by removing edges of $P_\ell$, where $P_\ell$ is a…

Codimension 2 complete intersections in P^N have a natural parameter space \bar{H}: a projective bundle over a projective space given by the choice of the lower degree equation and of the higher degree equation up to a multiple of the…

Let I be an m-primary ideal of a Noetherian local ring (R,m). We consider the Gorenstein and complete intersection properties of the associated graded ring G(I) and the fiber cone F(I) of I as reflected in their defining ideals as…

A subgraph $H$ of a multigraph $G$ is overfull if $ |E(H) | > \Delta(G) \lfloor |V(H)|/2 \rfloor$. Analogous to the Overfull Conjecture proposed by Chetwynd and Hilton in 1986, Stiebitz et al. in 2012 formed the multigraph version of the…

We classify connected graphs $G$ whose binomial edge ideal is Gorenstein. The proof uses methods in prime characteristic.