Acyclic orientations and chromatic generating functions (Q5937454)

From MaRDI portal
Revision as of 23:42, 4 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1619290
Language Label Description Also known as
English
Acyclic orientations and chromatic generating functions
scientific article; zbMATH DE number 1619290

    Statements

    Acyclic orientations and chromatic generating functions (English)
    0 references
    0 references
    21 February 2002
    0 references
    Let \(P_G(k)\) be the chromatic polynomial of a graph \(G\) with \(n\geq 2\) vertices, none of which is isolated. Let \(R_G(k)= P_G(k)/k(k+1)\). Now fix two adjacent vertices \(a\) and \(z\) in \(G\). Let \({\mathcal O}\) be an acyclic orientation of \(G\) having \(a\) as a source and \(z\) as a sink. A function \(f: V(G)\to \{0,1,\dots, k\}\) is \({\mathcal O}\)-compatible if: (i) if \((i,j)\) is an edge of \({\mathcal O}\), then \(f(i)\leq f(j)\); (ii) \(f(a)= 0\) and \(f(z)= k\); (iii) if \(s\) is another source of \({\mathcal O}\), then \(f(s)> 0\); and (iv) if \(t\) is another sink of \({\mathcal O}\), then \(f(t)< k\). The author shows that the coefficients of the polynomial \[ (1- t)^{n- 1}\sum^\infty_{k= 1} R_G(k) t^k \] are nonnegative and, in turn, that if \(k\) is a nonnegative integer then \((-1)^n R_G(-k)\) is the number of pairs \(({\mathcal O},f)\) such that \({\mathcal O}\) is an acyclic orientation of \(G\) in which \(a\) is a source and \(z\) is a sink, and \(f\) is an \({\mathcal O}\)-compatible function from \(V(G)\) to \(\{0,1,\dots, k\}\).
    0 references
    chromatic polynomial
    0 references
    acyclic orientation
    0 references

    Identifiers