Order quasisymmetric functions distinguish rooted trees
From MaRDI portal
Publication:1686218
DOI10.1007/s10801-017-0761-7zbMath1423.06011arXiv1610.03908OpenAlexW2533736584MaRDI QIDQ1686218
Takahiro Hasebe, Shuhei Tsujie
Publication date: 21 December 2017
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.03908
Symmetric functions and generalizations (05E05) Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Algebraic aspects of posets (06A11)
Related Items (9)
Positivity among \(P\)-partition generating functions ⋮ Quasisymmetric functions distinguishing trees ⋮ A rooted variant of Stanley's chromatic symmetric function ⋮ On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial ⋮ The chromatic symmetric functions of trivially perfect graphs and cographs ⋮ Unnamed Item ⋮ \(P\)-partition generating function equivalence of naturally labeled posets ⋮ \(P\)-partition generating function equivalence of naturally labeled posets ⋮ A new characterization of \(\mathcal{V} \)-posets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proper caterpillars are distinguished by their chromatic symmetric function
- Graphs with equal chromatic symmetric functions
- Equality of \(P\)-partition generating functions.
- A weighted graph polynomial from chromatic invariants of knots
- A symmetric function generalization of the chromatic polynomial of a graph
- On distinguishing trees by their chromatic symmetric functions
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- Graph Polynomials and Their Applications II: Interrelations and Interpretations
- An introduction to chromatic polynomials
- Ordered structures and partitions
- The algebra of quasi-symmetric functions is free over the integers
This page was built for publication: Order quasisymmetric functions distinguish rooted trees
