Related papers: Minimal links and a result of Gaeta

We let R be a one-dimensional graded complete intersection, satisfying certain degree conditions which are satisfied whenever R is a numerical semigroup ring of embedding dimension at least three. We show that a graded maximal…

Let $G=(V,E)$ be any undirected graph on $V$ vertices and $E$ edges. A path $\textbf{P}$ between any two vertices $u,v\in V$ is said to be $t$-approximate shortest path if its length is at most $t$ times the length of the shortest path…

We provide a structure theorem for all almost complete intersection ideals of depth three in any Noetherian local ring. In particular, we find that the minimal generators are the pfaffians of suitable submatrices of an alternating matrix.…

We define a notion of a connectivity structure on an $\infty$-category, analogous to a $t$-structure but applicable in unstable contexts -- such as spaces, or algebras over an operad. This allows us to generalize notions of n-skeleta,…

The vertex (resp. edge) metric dimension of a connected graph G; denoted by dim(G) (resp. edim(G)), is defined as the size of a smallest set S in V (G) which distinguishes all pairs of vertices (resp. edges) in G: Bounds dim(G) <=…

We propose a concept of module liaison that extends Gorenstein liaison of ideals and provides an equivalence relation among unmixed modules over a commutative Gorenstein ring. Analyzing the resulting equivalence classes we show that several…

Suppose that $f\colon X\to\mathrm{Spec}\, R$ is a minimal model of a complete local Gorenstein 3-fold, where the fibres of $f$ are at most one dimensional, so by [VdB1d] there is a noncommutative ring $\Lambda$ derived equivalent to $X$.…

Let $G$ be a regular graph of degree $d$ and let $A\subset V(G)$. Say that $A$ is $\eta$-closed if the average degree of the subgraph induced by $A$ is at least $\eta d$. This says that if we choose a random vertex $x\in A$ and a random…

Define an embedding of graph $G=(V,E)$ with $V$ a finite set of distinct points on the unit circle and $E$ the set of line segments connecting the points. Let $V_1,\ldots,V_k$ be a labeled partition of $V$ into equal parts. A 2-factor is…

Let v(G) and dom(G) denote the number of vertices and the domination number of a graph G, and let r (G) = dom(G)/v(G)$. Let [x] and ]x[ be the floor and the ceiling of a number x. In 1996 B. Reed conjectured that if G is a cubic graph, then…

A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…

A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader's result by replacing the…

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$, every $k$-connected (or $k$-edge-connected) graph $G$ with minimum degree at least $k+m-1$ contains a tree $T'\cong T$ such that $G-E(T')$ is…

Let $G$ be a graph of order $n$ and let $u,v$ be vertices of $G$. Let $\kappa_G(u,v)$ denote the maximum number of internally disjoint $u$-$v$ paths in $G$. Then the average connectivity $\overline{\kappa}(G)$ of $G$, is defined as $…

Luo, Tian and Wu (2022) conjectured that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with minimum degree at least $k+t$, where $t=$max$\{|X|,|Y|\}$, contains a tree $T'\cong T$ such that $G-V(T')$…

Gorenstein liaison seems to be the natural notion to generalize to higher codimension the well-known results about liaison of varieties of codimension~2 in projective space. In this paper we study points in ${\mathbb P}^3$ and curves in…

The {\it Randi\'c index} $R(G)$ of a graph $G$ is defined as the sum of 1/\sqrt{d_ud_v} over all edges $uv$ of $G$, where $d_u$ and $d_v$ are the degrees of vertices $u$ and $v,$ respectively. Let $D(G)$ be the diameter of $G$ when $G$ is…

Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…

We construct finite element approximations of the Levi-Civita connection and its curvature on triangulations of oriented two-dimensional manifolds. Our construction relies on the Regge finite elements, which are piecewise polynomial…

We show that, if a building is endowed with its complete system of apartments, and if each panel is contained in at least four chambers, then the intersection of two apartments can be any convex subcomplex contained in an apartment. This…