Related papers: Alexander polynomial and spanning trees
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
Murasugi discovered two criteria that must be satisfied by the Alexander polynomial of a periodic knot. We generalize these to the case of twisted Alexander polynomials. Examples demonstrate the application of these new criteria, including…
In the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…
Fox conjectured the Alexander polynomial of an alternating knot is trapezoidal, i.e. the coefficients first increase, then stabilize and finally decrease in a symmetric way. Recently, Hirasawa and Murasugi further conjectured a relation…
The Pontryagin dual of the twisted Alexander module for a d-component link and GL(N,Z) representation is an algebraic dynamical system with an elementary description in terms of colorings of a diagram. In the case of a knot, its associated…
We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.
We prove that two horizontal-strip LLT polynomials are equal if the associated weighted graphs defined by the author in a previous paper are isomorphic. This provides a sufficient condition for equality of horizontal-strip LLT polynomials…
We prove that for any zero {\alpha} of the Alexander polynomial of a two-bridge knot, -3 < Re({\alpha}) < 6. Furthermore, for a large class of two-bridge knots we prove -1<Re({\alpha}).
The number of spanning trees in a graph $G$ is the total number of distinct spanning subgraphs of $G$ that are trees. In this paper we characterize the unique graph with a prescribed vertex (resp. edge) connectivity, minimum degree and…
In this paper we show that the twisted Alexander polynomial associated to a parabolic representation determines fiberedness and genus of a wide class of 2-bridge knots. As a corollary we give an affirmative answer to a conjecture of…
We give a short introduction to the theory of twisted Alexander polynomials of a 3--manifold associated to a representation of its fundamental group. We summarize their formal properties and we explain their relationship to twisted…
Using the special value at $u=1$ of Artin-Ihara $L$-functions, we associate to every $\mathbb{Z}$-cover of a finite connected graph a polynomial which we call the \emph{Ihara polynomial}. We show that the number of spanning trees for the…
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…
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.
Symmetric edge polytopes of graphs and root polytopes of semi-balanced digraphs are two classes of lattice polytopes whose $h^*$-polynomials have interesting properties and generalize important graph polynomials. For both classes of…
After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced. Its graded Euler characteristic recovers the…
We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial…
We explore the codimension one strata in the degree-one cohomology jumping loci of a finitely generated group, through the prism of the multivariable Alexander polynomial. As an application, we give new criteria that must be satisfied by…
We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…