Patterns in Khovanov link and chromatic graph homology
From MaRDI portal
Publication:4634896
Abstract: Khovanov homology of a link and chromatic graph homology are known to be isomorphic in a range of homological gradings that depend on the girth of a graph. We discuss patterns shared by these two homology theories. In particular, we improve the bounds for the homological span of chromatic homology by Helme-Guizon, Przytycki and Rong. An explicit formula for the rank of the third chromatic homology group on the main diagonal is given and used to compute the corresponding Khovanov homology group and the fourth coefficient of the Jones polynomial for links with certain diagrams.
Recommendations
- Khovanov homology of graph-links
- On the Khovanov-Rozansky homology of graphs and links
- Patterns in odd Khovanov homology
- Khovanov homology and periodic links
- Khovanov type homologies for graphs
- The Novikov homology of graph links
- Patterns in Knot Cohomology, I
- Publication:4945331
- Chromatic homology, Khovanov homology, and torsion
- On Invariants of Graphs with Applications to Knot Theory
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3530652 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 2199828 (Why is no real title available?)
- scientific article; zbMATH DE number 3270498 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- A categorification for the chromatic polynomial
- A categorification of the Jones polynomial
- An endomorphism of the Khovanov invariant
- Block-cutvertex trees and block-cutvertex partitions
- Characterizations of outerplanar graphs
- Chromatic homology, Khovanov homology, and torsion
- Chromatic polynomials, polygon trees, and outerplanar graphs
- Chromatically unique graphs
- Chromatically unique multibridge graphs
- Cutpoints and the chromatic polynomial
- FAST KHOVANOV HOMOLOGY COMPUTATIONS
- Graph theory with applications
- Homologically thin, non-quasi-alternating links
- Khovanov homology and the slice genus
- Khovanov homology, its definitions and ramifications
- Khovanov homology: torsion and thickness
- Khovanov type homologies for graphs
- Knight move in chromatic cohomology
- LinKnot. Knot theory by computer
- On Khovanov's categorification of the Jones polynomial
- On chromatic coefficients
- On matroids determined by their Tutte polynomials
- On the Khovanov and knot Floer homologies of quasi-alternating links
- On the first group of the chromatic cohomology of graphs
- On the head and the tail of the colored Jones polynomial
- On trees of polygons
- Search for torsion in Khovanov homology
- The Khovanov homology of 3-strand pretzels, revisited
- The Khovanov homology of \((p, -p,q)\) Pretzel knots
- The Khovanov homology of a family of three-column pretzel links
- The rational Khovanov homology of 3-strand pretzel links
- Torsion in Khovanov homology of homologically thin knots
- Torsion in Khovanov homology of semi-adequate links
- Torsion in graph homology
- Torsion of Khovanov homology
- Two classes of chromatically unique graphs
- When the theories meet: Khovanov homology as Hochschild homology of links
Cited in
(11)- Near extremal Khovanov homology of Turaev genus one links
- Almost-extreme Khovanov spectra
- Khovanov homology of graph-links
- A broken circuit model for chromatic homology theories
- Knight move in chromatic cohomology
- On the strength of chromatic symmetric homology for graphs
- Link invariants, the chromatic polynomial and the Potts model
- On links with Khovanov homology of small ranks
- On the first group of the chromatic cohomology of graphs
- Extremal Khovanov homology and the girth of a knot
- Chromatic homology, Khovanov homology, and torsion
This page was built for publication: Patterns in Khovanov link and chromatic graph homology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634896)