相关论文: Graph Cohomologies from Arbitrary Algebras

For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known…

For any graph G we define bigraded cohomology groups whose graded Euler characteristic is a multiple of the Yamada polynomial of G.

We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…

By coloring a signed graph by signed colors, one obtains the signed chromatic polynomial of the signed graph. For each signed graph we construct graded cohomology groups whose graded Euler characteristic yields the signed chromatic…

Khovanov introduced a bigraded cohomology theory of links whose graded Euler characteristic is the Jones polynomial. The theory was subsequently applied to the chromatic polynomial of graph, resulting in a categorification known as the…

In this paper, for each graph $G$, we def\mbox{}ine a chain complex of graded modules over the ring of polynomials, whose graded Euler characteristic is equal to the chromatic polynomial of $G$. Furthermore, we def\mbox{}ine a chain complex…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

For each graph and each positive integer $n$, we define a chain complex whose graded Euler characteristic is equal to an appropriate $n$-specialization of the dichromatic polynomial. This also gives a categorification of $n$-specializations…

Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

We construct a bigraded cohomology theory of links whose Euler characteristic is the Jones polynomial.

An analog of Kreimer's coproduct from renormalization of Feynman integrals in quantum field theory, endows an analog of Kontsevich's graph complex with a dg-coalgebra structure. The graph complex is generated by orientation classes of…

We introduce a graded homology theory for graded \'etale groupoids. For $\mathbb Z$-graded groupoids, we establish an exact sequence relating the graded zeroth-homology to non-graded one. Specialising to the arbitrary graph groupoids, we…

We compute the cohomology with trivial coefficients of two graded infinite-dimensional Lie algebras of maximal class, give explicit formulas for their representative cocycles. Also we discuss the relations with combinatorics and…

J. Przytycki has established a connection between the Hochschild homology of an algebra $A$ and the chromatic graph homology of a polygon graph with coefficients in $A$. In general the chromatic graph homology is not defined in the case…

For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.

The moduli space of rank $n$ graphs, the outer automorphism group of the free group of rank $n$ and Kontsevich's Lie graph complex have the same rational cohomology. We show that the associated Euler characteristic grows like…

In this paper, we construct a differential graded Lie algebra whose Maurer-Cartan elements are given by crossed homomorphisms on Leibniz algebras. This allows us to define cohomology for a crossed homomorphism. Finally, we study linear…

We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such…

\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…