vix.ing · top · new · best · stats · spec

Chromatic polynomials and bialgebras of graphs

2016/11/14 by Loïc Foissy, Foissy, Loïc · 1 citation
Mathematics · #FOS: Mathematics #Rings and Algebras (math.RA) #math.RA

paper · pdf · doi:10.48550/arxiv.1611.04303

40 pages. Final version

arxiv created 2021/05/04 · arxiv updated 2021/05/05

Abstract

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a contraction-extraction process. This gives Hopf-algebraic proofs of Rota's result on the signs of coefficients of chromatic polynomials and of Stanley's interpretation of the values at negative integers of chromatic polynomi-als. We also give non-commutative version of this construction, replacing graphs by indexed graphs and Q[X] by the Hopf algebra WSym of set partitions.

Cited by

Related