The path-cycle symmetric function of a digraph

DOI10.1006/aima.1996.0018zbMath0847.05098OpenAlexW2147911079MaRDI QIDQ1915384

Timothy Y. Chow

Publication date: 16 June 1996

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3ad30e551ff22720a821be2f678b5a714df811f3

zbMATH Keywords

symmetric functionchromatic polynomialchromatic symmetric functionincomparability graphcombinatorial reciprocity theoremrook polynomialscover polynomialdigraph polynomial

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Directed graphs (digraphs), tournaments (05C20)

Related Items

The drop polynomial of a weighted digraph, An interpretation for Garsia and Remmel's \(q\)-hit numbers, Factorization of the cover polynomial, A deletion-contraction relation for the chromatic symmetric function, Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function, The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences, The coloring ideal and coloring complex of a graph, Unit interval orders and the dot action on the cohomology of regular semisimple Hessenberg varieties, From a zoo to a zoology: Towards a general theory of graph polynomials, Unit interval orders and the dot action on the cohomology of regular semisimple Hessenberg varieties, Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems., Generalized rook polynomials, The cycle-path indicator polynomial of a digraph, Further investigation involving rook polynomials with only real zeros, Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)