Related papers: Edge rings with $3$-linear resolutions

Let $ G=(V,E) $ be a simple graph of order $ n $ and size $ m $. A connected edge cover set of a graph is a subset $S$ of edges such that every vertex of the graph is incident to at least one edge of $S$ and the subgraph induced by $S$ is…

Fix two parallel circles in $\mathbb{R}^3$ centered about a common axis. Among surfaces of revolution immersed in $\mathbb{R}^3$ whose boundary is given by these circles, there is one which maximizes the first Dirichlet eigenvalue. If the…

The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawings where edges are represented by few segments. In such a…

We prove a topological extension of Dirac's theorem suggested by Gowers in 2005: for any connected, closed surface $\mathscr{S}$, we show that any two-dimensional simplicial complex on $n$ vertices in which each pair of vertices belongs to…

Edge ideals of finite simple graphs are well-studied over polynomial rings. In this paper, we initiate the study of edge ideals over exterior algebras, specifically focusing on the depth and singular varieties of such ideals. We prove an…

We study the topology of the boundary manifold of a regular neighborhood of a complex projective hypersurface. We show that, under certain Hodge theoretic conditions, the cohomology ring of the complement of the hypersurface functorially…

This article provides structural characterization of simple graphs whose edge-set can be partitioned into maximum matchings. We use Vizing's classification of simple graphs based on edge chromatic index.

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d(u,w)$ denote the length of a $u-w$ geodesic in $G$. For any $v\in V(G)$ and $e=xy\in E(G)$, let $d(e,v)=\min\{d(x,v),d(y,v)\}$. For distinct $e_1, e_2\in E(G)$, let…

We show that the complement of a degree $d$ hypersurface in a projective complete intersection, whose defining equations have degrees strictly larger than $d$, has a rational connectivity higher than expected. The key new feature is that a…

For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.

Let $f\in W^{3,1}_{\mathrm{loc}}(\Omega)$ be a function defined on a connected open subset $\Omega\subseteq\mathbb R^2$. We will show that its graph is contained in a quadratic surface if and only if $f$ is a weak solution to a certain…

A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called extremal for the triple $(k, g, \lambda)$ if has the…

Let $F$ be a graph. A hypergraph is called Berge $F$ if it can be obtained by replacing each edge in $F$ by a hyperedge containing it. Given a family of graphs $\mathcal{F}$, we say that a hypergraph $H$ is Berge $\mathcal{F}$-free if for…

This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…

We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…

We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…

We obtain sharp estimates on the connectivity of complex affine hypersurfaces in terms of the decomposition of the defining equation as a sum of weighted homogeneous components relative to some weight system.

A K3 surface over a number field has infinitely many rational points over a finite field extension. For K3 surfaces of degree 2, arising as double covers of $\mathbb{P}^2$ branched along a smooth sextic curve, we give a bound for the degree…

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…

Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_1, \ldots, x_n\}$ and $I(G) \subset K[V(G)]$ its edge ideal, where $K[V(G)]$ is the polynomial ring in $x_1, \ldots, x_n$ over a field $K$ with each ${\rm deg} x_i = 1$ and…