Related papers: Spanning trees and Khovanov homology
A spanning 2-forest separating vertices $u$ and $v$ of an undirected connected graph is a spanning forest with 2 components such that $u$ and $v$ are in distinct components. Aside from their combinatorial significance, spanning 2-forests…
Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…
For a connected labelled graph $G$, a {\em spanning tree} $T$ is a connected and an acyclic subgraph that spans all vertices of $G$. In this paper, we consider a classical combinatorial problem which is to list all spanning trees of $G$. A…
A tree is said to be even if for every pair of distinct leaves, the length of the unique path between them is even. In this paper we discuss the problem of determining whether an input graph has a spanning even tree. Hofmann and Walsh…
We describe a "concentration on the diagonal" condition on the Khovanov complex of tangles, show that this condition is satisfied by the Khovanov complex of the single crossing tangles, and prove that it is preserved by alternating planar…
The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical enumeration of…
We consider all spanning trees of a complete simple graph $\Gamma$ on $n$ vertices that contain a given $m-$forest $F$. We show that the number of such spanning trees, $\tau(F)$, doesn't depend on the structure of $F$ and is completely…
We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…
Springer varieties appear in both geometric representation theory and knot theory. Motivated by knot theory and categorification Khovanov provides a topological construction of $(n/2, n/2)$ Springer varieties. We extend Khovanov's…
We introduce colored Jones polynomials of nanowords and their categorification. We also prove the existence of a Khovanov-type bicomplex which has three grades.
The aim of this paper is two-fold. First, we give a fully geometric description of the HOMFLYPT homology of Khovanov-Rozansky. Our method is to construct this invariant in terms of the cohomology of various sheaves on certain algebraic…
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…
Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an…
A tree with at most $k$ leaves is called a $k$-ended tree. A spanning 2-ended tree is a Hamilton path. A Hamilton cycle can be considered as a spanning 1-ended tree. The earliest result concerning spanning trees with few leaves states that…
We construct an action of a polynomial ring on the colored sl(2) link homology of Cooper-Krushkal, over which this homology is finitely generated. We define a new, related link homology which is finite dimensional, extends to tangles, and…
Circuit topology employs fundamental units of entanglement, known as soft contacts, for constructing knots from the bottom up, utilising circuit topology relations, namely parallel, series, cross, and concerted relations. In this article,…
We present a linear programming based algorithm for computing a spanning tree $T$ of a set $P$ of $n$ points in $\Re^d$, such that its crossing number is $O(\min(t \log n, n^{1-1/d}))$, where $t$ the minimum crossing number of any spanning…
This paper is devoted to one theory of hypergraph connectivity and presents the proof of the polynomial algorithm for finding an optimal spanning hyperforest(hypertree) for any given weighed q-uniform hypergraph.
For any connected multigraph $G=(V,E)$ and any $M\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\tau_G(M)$ is obtained,…
Using Bar-Natan's Khovanov homology we define a homology theory for coloured, oriented, framed links. We then compute this explicitly.