Chromatic polynomial, \(q\)-binomial counting and colored Jones function

DOI10.1016/j.aim.2006.09.001zbMath1114.05013OpenAlexW2028153041MaRDI QIDQ877731

Martin Loebl

Publication date: 3 May 2007

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2006.09.001

zbMATH Keywords

Tutte polynomialgraph isomorphism problemchromatic operatorquantum binomial identity

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30)

Related Items

The Potts model and chromatic functions of graphs, Unsigned state models for the Jones polynomial, New Graph Polynomials from the Bethe Approximation of the Ising Partition Function, Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-commutative formula for the colored Jones function
• State models and the Jones polynomial
• The Yang-Baxter equation and invariants of links
• Intersection theory for graphs
• A weighted graph polynomial from chromatic invariants of knots
• On the Nash-Williams' lemma in graph reconstruction theory
• The polychromate and a chord diagram polynomial
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• A symmetric function generalization of the chromatic polynomial of a graph
• On the Vassiliev knot invariants
• Contraction-deletion invariants for graphs