Related papers: The chromatic polynomial of fatgraphs and its cate…
We introduce a multi-parameter deformation of the triply-graded Khovanov--Rozansky homology of links colored by one-column Young diagrams, generalizing the "$y$-ified" link homology of Gorsky--Hogancamp and work of Cautis--Lauda--Sussan.…
In this paper, we present some properties on chromatic polynomials of hypergraphs which do not hold for chromatic polynomials of graphs. We first show that chromatic polynomials of hypergraphs have all integers as their zeros and contain…
We study hypergraphs which are uniquely determined by their chromatic, independence and matching polynomials. B. Bollob\'as, L. Pebody and O. Riordan (2000) conjectured (BPR-conjecture) that almost all graphs are uniquely determined by…
In this article, we give an elementary construction of homological invariants of links presented by braid closures. The Euler characteristic of this complex is equal to quantum polynomial invariant of link.
We investigate novel random graph embeddings that can be computed in expected polynomial time and that are able to distinguish all non-isomorphic graphs in expectation. Previous graph embeddings have limited expressiveness and either cannot…
A recent result of Lofano and Paolini expresses the characteristic polynomial of a real hyperplane arrangement in terms of a projection statistic on the regions of the arrangement. We use this result to give an alternative proof for Greene…
We describe an invariant of links in the three-sphere which is closely related to Khovanov's Jones polynomial homology. Our construction replaces the symmetric algebra appearing in Khovanov's definition with an exterior algebra. The two…
This paper is devoted to the study of algebraic structures leading to link homology theories. The originally used structures of Frobenius algebra and/or TQFT are modified in two directions. First, we refine 2-dimensional cobordisms by…
A graph G is H-free if it has no induced subgraph isomorphic to H. We prove that a $P_5$-free graph with clique number $\omega\ge 3$ has chromatic number at most $\omega^{\log_2(\omega)}$. The best previous result was an exponential upper…
In a recent paper Jones introduced a correspondence between elements of the Thompson group $F$ and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
It is well a known and fundamental result that the Jones polynomial can be expressed as Potts and vertex partition functions of signed plane graphs. Here we consider constructions of the Jones polynomial as state models of unsigned graphs…
The Stanley chromatic symmetric function $X_G$ of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology…
We prove that the Khovanov homology of alternating knots and 2-component links is equal (as a singly graded group) to the singular homology of a certain space of trace- free, binary dihedral representations of the link group. More…
There is a $p$-differential on the triply-graded Khovanov--Rozansky homology of knots and links over a field of positive characteristic $p$ that gives rise to an invariant in the homotopy category finite-dimensional $p$-complexes. A…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
The Bollob\'as-Riordan polynomial [Math. Ann. 323, 81 (2002)] is a universal polynomial invariant for ribbon graphs. We find an extension of this polynomial for a particular family of combinatorial objects, called rank 3 weakly-colored…
For any graph G we define bigraded cohomology groups whose graded Euler characteristic is a multiple of the Yamada polynomial of G.
We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…