加载中…
Motivated by Dohmen-P"onitz-Tittmann’s bivariate chromatic polynomial , which counts all -colorings of a graph such that adjacent vertices get different colors if they are , we introduce a bivarate version of Stanley’s order polynomial, which counts order preserving maps from a given poset to a chain. Our results include decomposition formulas in terms of linear extensions, a combinatorial reciprocity theorem, and connections to bivariate chromatic polynomials.

生成讲解博客的中文版本

生成AI智能校验的中文版本