Related papers: Splice diagram determining singularity links and u…
In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as…
We consider principal fibre bundles with a given connection and construct almost complex structures on the total space if the adjoint bundle is isomorphic to the tangent bundle of the base. We derive the integrability condition. If the…
We show that for any k>1, stratified sets of finite complexity are insufficient to realize all homology classes of codimension k in all smooth manifolds. We also prove a similar result concerning smooth generic maps whose double-point sets…
In this paper, we introduce the concept of spanning simplicial complexes $\Delta_s(G)$ associated to a simple finite connected graph G. We give the characterization of all spanning trees of the uni-cyclic graph $U_{n,m}$. In particular, we…
We present a new invariant, called slope, of a colored link in an integral homology sphere and use this invariant to complete the signature formula for the splice of two links. We develop a number of ways of computing the slope and a few…
We construct a singular homology theory on the category of schemes of finite type over a Dedekind domain and verify several basic properties. For arithmetic schemes we construct a reciprocity isomorphism between the integral singular…
The Separatrix Theorem of C. Camacho and P. Sad guarantees the existence of invariant curve (separatrix) passing through the singularity of germ of holomorphic foliation on complex surface, when the surface underlying the foliation is…
We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
Let K be a knot in an integral homology 3-sphere and let B denote the 2-fold branched cover of the integral homology sphere branched along K. We construct a map from the slice of characters with trace free along meridians in the SL(2,…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…
We prove that every 2-sphere graph different from a prism can be vertex 4-colored in such a way that all Kempe chains are forests. This implies the following three tree theorem: the arboricity of a discrete 2-sphere is 3. Moreover, the…
We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…
We define the slope of a colored link in an integral homology sphere, associated to admissible characters on the link group. Away from a certain singular locus, the slope is a rational function which can be regarded as a multivariate…
Consider a dihedral cover $f: Y\to X$ with $X$ and $Y$ four-manifolds and $f$ branched along an oriented surface embedded in $X$ with isolated cone singularities. We prove that only a slice knot can arise as the unique singularity on an…
A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…
A graph $G$ on $n$ vertices is Hamiltonian if it contains a spanning cycle, and pancyclic if it contains cycles of all lengths from 3 to $n$. In 1984, Fan presented a degree condition involving every pair of vertices at distance two for a…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…