The Equivalence of Two Graph Polynomials and a Symmetric Function
| dc.creator | Merino, Criel | |
| dc.creator | Noble, Steven D. | |
| dc.date | 2008-05-30 | |
| dc.date.accessioned | 2026-07-07T09:41:54Z | |
| dc.date.available | 2026-07-07T09:41:54Z | |
| dc.description | The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial due to Stanley are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the coefficients of any other. The definition of each of these functions suggests a natural way in which to generalize them which also captures Tutte's universal V-functions as a specialization. We show that the equivalence remains true for the extended functions thus answering a question raised by Dominic Welsh. | |
| dc.description | 17 pages | |
| dc.identifier | https://arxiv.org/abs/0805.4793 | |
| dc.identifier | http://arxiv.org/abs/0805.4793 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/161994 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A19 (Primary) 05A15, 05C15 (Secondary) | |
| dc.title | The Equivalence of Two Graph Polynomials and a Symmetric Function | |
| dc.type | text |