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

Among other things, it is shown that for every pair of positive integers $r$, $d$, satisfying $1<r<d\leq 2r$, and every finite simple graph $H,$ there is a connected graph $G$ with diameter $d$, radius $r$, and center $H.$

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…

By generalizing a recent result of Hong, Liu, and Lai on characterizing the degree-sequences of simple strongly connected directed graphs, a characterization is provided for degree-sequences of simple $k$-node-connected digraphs. More…

Let $Y_{3,2}$ be the 3-graph with two edges intersecting in two vertices. We prove that every 3-graph $ H $ on $ n $ vertices with at least $ \max \left \{ \binom{4\alpha n}{3}, \binom{n}{3}-\binom{n-\alpha n}{3} \right \}+o(n^3) $ edges…

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…

We construct examples of flat surfaces in $\mathbb{H}^3$ which are graphs over a two-punctured horosphere and classify complete embedded flat surfaces in $\mathbb{H}^3$ with only one end and at most two isolated singularities.

Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least…

By the famous ADE classification rational double points are simple. Rational triple points are also simple. We conjecture that the simple normal surface singularities are exactly those rational singularities, whose resolution graph can be…

In this paper we denote a type of affine homogeneous real hypersurface of $\mathbb{C}^3$ and present a classification of homogeneous surfaces of the type (1/2,0). The result was obtained by reducing the classification problem mentioned…

Recent work on generic free resolutions of length 3 attaches to every resolution a graph and suggests that resolutions whose associated graph is a Dynkin diagram are distinguished. We conjecture that in a regular local ring, every grade 3…

We show that a 3-manifold containing an incompressible surface has topologically minimal surfaces of arbitrary high genus.

The existence of essential closed surfaces surfaces is proven for finite coverings of 3-manifolds that are triangulated by finitely many topological ideal tetrahedra and admit a regular, negatively curved, ideal structure.

We show that every small resolution of a three-dimensional terminal hypersurface singularity can occur on a non-embeddable 1-convex manifold. We give an explicit example of a non-embeddable manifold containing an irreducible exceptional…

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…

The generalized $k$-edge-connectivity $\lambda_k(G)$ of a graph $G$ is a generalization of the concept of edge-connectivity. The lexicographic product of two graphs $G$ and $H$, denoted by $G\circ H$, is an important graph product. In this…

We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained by drawings whose vertex and crossing resolution is at least…

In this work, we show that for a certain class of threefolds in positive characteristics, rational-chain-connectivity is equivalent to supersingularity. The same result is known for K3 surfaces with elliptic fibrations. And there are…

In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…