In this paper we present some results on the sequence of coefficients of the chromatic polynomial of a graph relative to the complete graph basis, that is, when it is expressed as the sum of the chromatic polynomials of complete graphs. These coefficients are the coefficients of what is often called
A chromatic partition polynomial
✍ Scribed by Einar Steingrímsson
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 618 KB
- Volume
- 180
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
A polynomial in two variables is defned by C,(x,t)= ~-~cn,, Z( a~,x)tl~l, where Hn is the lattice of partitions of the set { I, 2 ..... n}, G~ is a certain interval graph defined in terms of the partition 7r, z(G~,x) is the chromatic polynomial of G~ and Inl is the number of blocks in n. It " t ~-~i=0 (~-ik)S(n'i)(x)i' where S(n,i) is the Stirling number of is shown that Cn(x, t)= ~k=0 k k the second kind and (x)i = x(x-1)... (x-i + 1). As a special case, Cn(-1,-t) = An(t), where A~(t) is the nth Eulerian polynomial. Moreover, An(t)= ~-~cn,, a"tl~P, where a~ is the number of acyclic orientations of G..
R6sum6
On d6finit un polyn6me en deux variables par C.(x,t)= ~.etl,, Z( G~,x)tl~q, off H~ est le treillis des partitions de l'ensemble { 1,2 ..... n}, G. est un certain graphe d'intervalles d6fini en termes de la partition n, )~ (G~,x) est le polyn6me chromatique de G~ et Ircl est le nombre de n n--i blocs de 7t. On montre que Cn(x,t)= ~--~k=0 tk ~=0 (n--k) S(n'i)(x)i Off S(r/,i) est le nombre de Stirling de deuxi6me esp~ce et (x)i =x(x-1).-. (x-i + 1). En particulier, Cn(-1,-t) =A,(t), off An(t) est le n-i~me polyn6me eul6rien. De plus, An(t)= ~-~cn,, a~tl~l, off an est le nombre d'orientations acycliques de G~.
📜 SIMILAR VOLUMES
In this paper it is proved that if the chromatic polynomial P(G; 2) is maximum for 2 = 3 in the class of 3-chromatic 2-connected graphs G of order n, then G is isomorphic to the graph consisting of C4 and Cn-l, having in common a path of length two for every even n/> 6. This solves a conjecture rais
Let P(G, \*) denote the chromatic polynomial of a graph G. It is proved in this paper that for every connected graph G of order n and real number \* n, (\*&2) n&1 P(G, \*)&\*(\*&1) n&2 P(G, \*&1) 0. By this result, the following conjecture proposed by Bartels and Welsh is proved: P(G, n)(P(G, n&1))
dedicated to professor w. t. tutte on the occasion of his eightieth birthday Let P(\*) be the chromatic polynomial of a graph. We show that P(5) &1 P(6) 2 P(7) &1 can be arbitrarily small, disproving a conjecture of Welsh (and of Brenti, independently) that P(\*) 2 P(\*&1) P(\*+1) and also disprovi
We outline an approach to enumeration problems which relies on the algebra of free abelian groups, giving as our main application a generalisation of the chromatic polynomial of a simple graph G. Our polynomial lies in the free abelian group generated by the poset K(G) of contractions of G, and redu