相关论文: The Conway potential function of a graph link
We obtain bounds on hyperbolic volume for periodic links and Conway sums of alternating tangles. For links that are Conway sums we also bound the hyperbolic volume in terms of the coefficients of the Jones polynomial.
Given graphs $X$ and $Y$, we define two conic feasibility programs which we show have a solution over the completely positive cone if and only if there exists a homomorphism from $X$ to $Y$. By varying the cone, we obtain similar…
The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.
We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…
Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrinsic $n$-component link might exist. We show that, indeed,…
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…
For a positive braid link, a link represented as a closed positive braids, we determine the first few coefficients of its HOMFLY polynomial in terms of geometric invariants such as, the maximum euler characteristics, the number of split…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
Let $\Delta$ be a trivial knot in the three-sphere. For every finite cyclic group $G$ of odd order, we construct a $G$-equivariant Khovanov homology with coefficients in the filed $\F_{2}$. This homology is an invariant of links up to…
Khovanov homology is an invariant for links in the three sphere that categorizes the Jones polynomial. We extend Khovanov's construction to links in 3-manifolds that are connected sums of orientable interval bundles over surfaces. Cutting…
In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…
This note defines a flag vector for $i$-graphs. The construction applies to any finite combinatorial object that can be shelled. Two possible connections to quantum topology are mentioned. Further details appear in the author's "On quantum…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
When restricted to alternating links, both Heegaard Floer and Khovanov homology concentrate along a single diagonal $\delta$-grading. This leads to the broader class of thin links that one would like to characterize without reference to the…
We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
Based on the analogy between knots and primes, J. Hillman, D. Matei and M. Morishita defined the Iwasawa invariants for sequences of cyclic covers of links with an analogue of Iwasawa's class number formula of number fields. In this paper,…