相关论文: A categorification for the chromatic polynomial
In an earlier paper, the present authors (2013) introduced the altermatic number of graphs and used Tucker's Lemma, an equivalent combinatorial version of the Borsuk-Ulam Theorem, to show that the altermatic number is a lower bound for the…
We study graphs whose chromatic number is close to the order of the graph (the number of vertices). Both when the chromatic number is a constant multiple of the order and when the difference of the chromatic number and the order is a small…
In [Duke Math. J. 101 (1999) 359-426], Mikhail Khovanov constructed a homology theory for oriented links, whose graded Euler characteristic is the Jones polynomial. He also explained how every link cobordism between two links induces a…
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
We study the list-chromatic number and the coloring number of graphs, especially uncountable graphs. We show that the coloring number of a graph coincides with its list-chromatic number provided that the diamond principle holds. Under the…
We introduce colored Jones polynomials of nanowords and their categorification. We also prove the existence of a Khovanov-type bicomplex which has three grades.
The main result of this paper is the introduction of marked graphs and the marked graph polynomials ($M$-polynomial) associated with them. These polynomials can be defined via a deletion-contraction operation. These polynomials are a…
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…
Resolving a 1985 open problem of Gy\'arf\'as, we prove that chromatic number is polynomially bounded by clique number for graphs with no induced five-vertex path $P_5$. Our approach introduces a chromatic density framework involving…
We obtain a precise relation between the Chern-Schwartz-MacPherson class of a subvariety of projective space and the Euler characteristics of its general linear sections. In the case of a hypersurface, this leads to simple proofs of…
We present the Chromatic Persistence Algorithm (CPA), an event-driven method for computing persistent cohomological features of weighted graphs via graphic arrangements, a classical object in computational geometry. We establish rigorous…
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…
In two previous papers, the author showed how to decompose the Khovanov homology of a link $\mathcal{L}$ into the algebraic pairing of a type D structure and a type A structure (as defined in bordered Floer homology), whenever a diagram for…
We propose a framework for unifying the sl(N) Khovanov-Rozansky homology (for all N) with the knot Floer homology. We argue that this unification should be accomplished by a triply graded homology theory which categorifies the HOMFLY…
In this short note we observe that recent results of Abert and Hubai and of Csikvari and Frenkel about Benjamini--Schramm continuity of the holomorphic moments of the roots of the chromatic polynomial extend to the theory of dense graph…
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
For each positive integer n, Khovanov and Rozansky constructed an invariant of links in the form of a doubly-graded cohomology theory whose Euler characteristic is the sl(n) link polynomial. We use Lagrangian Floer cohomology on some…
The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…
This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…