The following pages link to A Coloring Problem (Q3983387):
Displaying 15 items.
- Counting permutations by runs (Q285069) (← links)
- The \(\gamma\)-positivity of basic Eulerian polynomials via group actions (Q491971) (← links)
- Fix-Mahonian calculus. III: a quadruple distribution (Q938317) (← links)
- Fix-Mahonian calculus. II: Further statistics (Q942165) (← links)
- Permutations with extremal number of fixed points (Q1003653) (← links)
- On the mean chromatic number (Q1322240) (← links)
- The \(r\)-multipermutations (Q1331143) (← links)
- Polytopes, permutation shapes and bin packing (Q1398288) (← links)
- On the (co)homology of the partition lattice and the free Lie algebra. (Q1584469) (← links)
- A unified approach to polynomial sequences with only real zeros (Q2381831) (← links)
- A combinatorial proof of a result of Gessel and Greene (Q2509304) (← links)
- UNIMODALITY AND COLOURED HOOK FACTORISATION (Q2786571) (← links)
- A passage time for greedy‐coloring cycles (Q4322478) (← links)
- The $q$-tangent and $q$-secant numbers via basic Eulerian polynomials (Q5189162) (← links)
- A new decomposition of derangements (Q5952339) (← links)
