Inequalities between gamma-polynomials of graph-associahedra
The electronic journal of combinatorics, Tome 19 (2012) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial order is given by relating trees that can be obtained from one another by operations called tree shifts. We also show that tree shifts lower the $\gamma$-polynomials of graphs that are not trees, as do the flossing moves of Babson and Reiner.
DOI : 10.37236/2401
Classification : 05C30, 05C05
Mots-clés : tree shifts

Natalie Aisbett  1

1 The University of Sydney
@article{10_37236_2401,
     author = {Natalie Aisbett},
     title = {Inequalities between gamma-polynomials of graph-associahedra},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {2},
     doi = {10.37236/2401},
     zbl = {1243.05112},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2401/}
}
TY  - JOUR
AU  - Natalie Aisbett
TI  - Inequalities between gamma-polynomials of graph-associahedra
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2401/
DO  - 10.37236/2401
ID  - 10_37236_2401
ER  - 
%0 Journal Article
%A Natalie Aisbett
%T Inequalities between gamma-polynomials of graph-associahedra
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2401/
%R 10.37236/2401
%F 10_37236_2401
Natalie Aisbett. Inequalities between gamma-polynomials of graph-associahedra. The electronic journal of combinatorics, Tome 19 (2012) no. 2. doi: 10.37236/2401

Cité par Sources :