Symmetric function generalizations of graph polynomials

dc.creatorChow, Timothy Y.
dc.date2001-03-30
dc.date.accessioned2026-07-07T04:40:52Z
dc.date.available2026-07-07T04:40:52Z
dc.descriptionIn Chapter 2 we study the path-cycle symmetric function of a digraph, a symmetric function generalization of Chung and Graham's cover polynomial. Most of this material appears in either Advances in Math. 118 (1996), 71-98 or J. Algebraic Combin. 10 (1999), 227-240. Chapter 3 contains miscellaneous results about Stanley's symmetric function generalization X_G of the chromatic polynomial, e.g., we establish a connection with some of Tutte's work on the chromatic polynomial and use this to prove that X_G is reconstructible. Most of Chapter 3 does not appear elsewhere.
dc.description70 pages. This is not a new paper; it is my 1995 Ph.D. thesis
dc.identifierhttps://arxiv.org/abs/math/0103229
dc.identifierhttp://arxiv.org/abs/math/0103229
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61183
dc.subjectCombinatorics
dc.subject05E05 (Primary) 05C15, 05C20 (Secondary)
dc.titleSymmetric function generalizations of graph polynomials
dc.typetext

Files

Collections