Related papers: The chromatic polynomial of fatgraphs and its cate…

We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…

In this paper, we discuss a proof of the isotopy invariance of a parametrized Khovanov link homology including categorifications of the Jones polynomial and the Kauffman bracket polynomial though it is a known fact. In order to present a…

This article is built upon three main ideas. First, for a class of monomial ideals, it is proven that the multiplicity of an ideal equals the number of realizations of its codimension (an intuitive concept that we define later). Next, for…

We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie…

We introduce an invariant of tangles in Khovanov homology by considering a natural inverse system of Khovanov homology groups. As application, we derive an invariant of strongly invertible knots; this invariant takes the form of a graded…

Besides offering a friendly introduction to knot homologies and quantum curves, the goal of these lectures is to review some of the concrete predictions that follow from the physical interpretation of knot homologies. In particular, this…

We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…

Let L be a null homologous link in $\mathbb{RP}^3$. We define Khovanov-type homologies of L which depend on an extra input $\alpha = (V_0,V_1,f,g)$ consisting of two graded vectors spaces and two maps between them. With some specific choice…

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…

By means of Rasmussen's formulation of Khovanov-Rozansky homology originally given over $\mathbb{Q}$ in arXiv:math/0607544, we compare different flavors of $\mathfrak{sl}(n)$ link homology with the link invariants obtained by Kitchloo in…

In this paper we analyze the open Feynman graphs of the Colored Group Field Theory introduced in [arXiv:0907.2582]. We define the boundary graph $\cG_{\partial}$ of an open graph $\cG$ and prove it is a cellular complex. Using this…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair…

We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…

The purpose of this paper is to interpret polynomial invariants of strongly invertible links in terms of Khovanov homology theory. To a divide, that is a proper generic immersion of a finite number of copies of the unit interval and circles…

C. Armond, S. Garoufalidis and T.Le have shown that a unicolored Jones polynomial of a B-adequate link has a stable tail at large colors. We categorify this tail by showing that Khovanov homology of a unicolored link also has a stable tail,…

We prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded graphs. This result is analogous to the fact that…

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…

In this note we show that any embedded graph has a checkerboard colourable twisted dual and any Eulerian embedded graph has a checkerboard colourable partial Petrial, answering questions posed by Ellis-Monaghan and Moffatt. The proofs are…