Related papers: Topological notions for Kauffman and Vogel's polyn…

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of…

We prove relations between the number of $k$-connected components of a graph, Crapo's invariant $\beta(M)$ of a matroid, and Speyer's polynomial $g_M(t)$. These yield a simple interpretation of $g_M'(-1)$ when $M$ is graphic or cographic.…

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…

Let $G$ be a bipartite graph with adjacency matrix $A(G)$. The characteristic polynomial $\phi(G,x)=\det(xI-A(G))$ and the permanental polynomial $\pi(G,x) = \text{per}(xI-A(G))$ are both graph invariants used to distinguish graphs. For…

We consider a connected negative definite plumbing graph, and we assume that the associated plumbed 3-manifold is a rational homology sphere. We provide two new combinatorial formulae for the Seiberg-Witten invariant of this manifold. The…

Let $G$ be an $n$-node graph without two disjoint odd cycles. The algorithm of Artmann, Weismantel and Zenklusen (STOC'17) for bimodular integer programs can be used to find a maximum weight stable set in $G$ in strongly polynomial time.…

This paper consists of three parts. First, we generalize the Jaeger Formula to express the Kauffman-Vogel graph polynomial as a state sum of the Murakami-Ohtsuki-Yamada graph polynomial. Then, we demonstrate that reversing the orientation…

Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $V\backslash S$ is a connected graph. In this paper we…

A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…

Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|^4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater…

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…

A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be…

We study framed links in irreducible 3-manifolds that are $Z$-homology 3-spheres or atoroidal $Q$-homology 3-spheres. We calculate the dual of the Kauffman skein module over the ring of two variable power series with complex coefficients.…

We recall Petit's construction of "dichromatic" invariants of 4-manifolds computed from Kirby diagrams using a nested pair of ribbon fusion categories $ B \subset C $ as initial data. Along the way we prove a lemma that fits the use of…

Let $\Gamma$ be a dual polar graph with diameter $D \geqslant 3$, having as vertices the maximal isotropic subspaces of a finite-dimensional vector space over the finite field $\mathbb{F}_q$ equipped with a non-degenerate form (alternating,…

We show how the multivariable signature and Alexander polynomial of a colored link can be computed from a single symmetric matrix naturally defined from a colored link diagram. In the case of a single variable, it coincides with the matrix…

Kauffman knot polynomial invariants are discovered in classical abelian Chern-Simons field theory. A topological invariant $t^{I\left( \mathcal{L} \right) }$ is constructed for a link $\mathcal{L}$, where $I$ is the abelian Chern-Simons…

The first part of the paper explains how to encode a one-cocycle and a two-cocycle on a group $G$ with values in its representation by networks of planar trivalent graphs with edges labelled by elements of $G$, elements of the…

For a undirected simple graph $G$, let $d_i(G)$ be the number of $i$-element dominating vertex set of $G$. The domination polynomial of the graph $G$ is defined as $$D(G, x) = \sum_{i = 1}^n d_i(G)x^i.$$ Alikhani and Peng conjectured that…