Related papers: Minimal links and a result of Gaeta

Suppose $(X_n)$ is a sequence of positive-dimensional smooth projective complete intersections over $\mathbb{F}_q$ with dimensions bounded from above and with characteristic zero lifts $(\tilde{X}_n)$ to smooth projective geometrically…

A graph $G$ is nonseparating projective planar if $G$ has a projective planar embedding without a nonsplit link. Nonseparating projective planar graphs are closed under taking minors and are a superclass of projective outerplanar graphs. We…

Let G' be a subgraph of a graph G. We define a down-link from a (K_v,G)-design B to a (K_n,G')-design B' as a map f:B->B' mapping any block of B into one of its subgraphs. This is a new concept, closely related with both the notion of…

A connected graph $\G$ is said to be {\it distance-balanced} whenever for any pair of adjacent vertices $u,v$ of $\G$ the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$. In…

Let $R$ be a local ring and $M$ a finitely generated $R$-module. The complete intersection dimension of $M$--defined by Avramov, Gasharov and Peeva, and denoted $\cidim_R(M)$--is a homological invariant whose finiteness implies that $M$ is…

In this expository paper we present short simple proofs of Conway-Gordon-Sachs' theorem on intrinsic linking in three-dimensional space, as well as van Kampen-Flores' and Ummel's theorems on intrinsic intersections. The latter are related…

The set $G$ of all $m$-dimensional subspaces of a $2m$-dimensional vector space $V$ is endowed with two relations, complementarity and adjacency. We consider bijections from $G$ onto $G'$, where $G'$ arises from a $2m'$-dimensional vector…

In this paper, we introduce super-minimally $k$-connected graphs, those $k$-connected graphs in which no proper subgraph is $k$-connected. For $k$ greater than or equal to three, this class lies strictly between the classes of minimally…

This paper brings together two theories in algebra that have had been extensively developed in recent years. First is the study of various homological dimensions and what information such invariants can give about a ring and its modules. A…

The following paper is inspired by Efimov's problem - an undecided problem of whether there exists an infinite compact topological space that does not contain neither non-trivial convergent sequences nor a copy of $\beta\omega$. After…

This paper introduces Auslander-Reiten triangles in subcategories of triangulated categories. The main theorem of the paper shows that there is a close connection with covers and envelopes, also known as minimal right- and…

The topology of an interconnection network can be modeled by a graph $G=(V(G),E(G))$. The connectivity of graph $G$ is a parameter to measure the reliability of corresponding network. Direct product is one important graph product. This…

We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic…

We give a two step method to study certain questions regarding associated graded module of a Cohen-Macaulay (CM) module $M$ w.r.t an $\mathfrak{m}$-primary ideal $\mathfrak{a}$ in a complete Noetherian local ring $(A,\mathfrak{m})$. The…

We take a sum $C_1+r C_2,\ r\in\mathbb Q$ of a line $C_1$ and a complete intersection curve $C_2$ of type $(3,3)$ inside a smooth surface of degree $8$ and with $C_1\cap C_2=\emptyset$. We gather evidences to the fact that for all except a…

In this paper we show how some known weak forms of the Zilber--Pink conjecture can be strengthened by combining them with the Mordell--Lang conjecture or its variants. We illustrate this idea by proving some theorems on atypical…

A graph is $n$-existentially closed ($n$-e.c.) if for any disjoint subsets $A$, $B$ of vertices with $|{A \cup B}|=n$, there is a vertex $z \notin A \cup B$ adjacent to every vertex of $A$ and no vertex of $B$. For a block design with block…

The Vapnik-Chervonenkis dimension (in short, VC-dimension) of a graph is defined as the VC-dimension of the set system induced by the neighborhoods of its vertices. We show that every $n$-vertex graph with bounded VC-dimension contains a…

Given a graph $G = (V,E)$, a set $T$ of vertex pairs, and an integer $k$, Hitting Geodesic Intervals asks whether there is a set $S \subseteq V$ of size at most $k$ such that for each terminal pair $\{u,v\} \in T$, the set $S$ intersects at…

Let $V$ be a finite dimensional vector space equipped with a non-degenerate Hermitian form over a field $\mathbb{K}$. Let $\mathcal{G}(V)$ be the graph with vertex set the $1$-dimensional non-degenerate subspaces of $V$ and adjacency…