Related papers: Link invariants, the chromatic polynomial and the …
We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with…
In this note we define a polynomial invariant for colored links by a skein relation. It specializes to the Jones polynomial for classical links.
Let $L$ be a link and $\Phi^{A}_{L}(q)$ its link invariant associated with the vector representation of the quantum (super)algebra $U_{q}(A)$. Let $F_{L}(r,s)$ be the Kauffman link invariant for $L$ associated with the…
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…
Let G be a combinatorial graph with vertices V and edges E. A proper coloring of G is an assignment of colors to the vertices such that no edge connects two vertices of the same color. These are the colorings considered in the famous Four…
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…
Khovanov homology ist a new link invariant, discovered by M. Khovanov, and used by J. Rasmussen to give a combinatorial proof of the Milnor conjecture. In this thesis, we give examples of mutant links with different Khovanov homology. We…
The survey we are presenting is over 22 years old but it has still some ideas which where never published (except in Polish). This survey is the base of the third Chapter of my book: KNOTS: From combinatorics of knot diagrams to…
Here we observe that list coloring in graph theory coincides with the zero-temperature antiferromagnetic Potts model with an external field. We give a list coloring polynomial that equals the partition function in this case. This is…
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an…
We discuss multivariable invariants of colored links associated with the $N$-dimensional root of unity representation of the quantum group. The invariants for $N>2$ are generalizations of the multi-variable Alexander polynomial. The…
In this article we describe a new inductive approach to compute the chromatic polynomial of simple graphs and the characteristic polynomial of central hyperplane arrangements.
Quantum invariants like the colored Jones polynomial are algebraic in nature but are conjectured to detect important information about the geometry of links. In this thesis we explore these connections using an enhanced version of the RT…
The chromatic polynomial is a well studied object in graph theory. There are many results and conjectures about the log-concavity of the chromatic polynomial and other polynomials related to it. The location of the roots of these…
Coloured Alexander polynomials form a sequence of non-semisimple quantum invariants coming from the representation theory of the quantum group $U_q(sl(2))$ at roots of unity. This sequence recovers the original Alexander polynomial as the…
A colored link, as defined by Francesca Aicardi, is an oriented classical link together with a coloration, which is a function defined on the set of link components and whose image is a finite set of colors. An oriented classical link can…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…
We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…
Let G be a graph, and let $\chi$G be its chromatic polynomial. For any non-negative integers i, j, we give an interpretation for the evaluation $\chi$ (i) G (--j) in terms of acyclic orientations. This recovers the classical interpretations…
We introduce the concepts of marked multi-colorings, marked chromatic polynomials, and marked (multivariate) independence series for hypergraphs. We show that the coefficients of the q-th power of the marked independence series of a…