A Coloring Problem

DOI10.2307/2324874zbMath0771.05009OpenAlexW2045951817MaRDI QIDQ3983387

Ira M. Gessel

Publication date: 27 June 1992

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7088bb01eabcca2a0298b3b974897df20cab7e7a

zbMATH Keywords

generating functionsgreedy algorithmcolouringpathnumber of vertex orderings

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)

Related Items (15)

The \(r\)-multipermutations ⋮ Counting permutations by runs ⋮ A unified approach to polynomial sequences with only real zeros ⋮ Polytopes, permutation shapes and bin packing ⋮ A passage time for greedy‐coloring cycles ⋮ Fix-Mahonian calculus. III: a quadruple distribution ⋮ The \(\gamma\)-positivity of basic Eulerian polynomials via group actions ⋮ Fix-Mahonian calculus. II: Further statistics ⋮ The $q$-tangent and $q$-secant numbers via basic Eulerian polynomials ⋮ UNIMODALITY AND COLOURED HOOK FACTORISATION ⋮ A new decomposition of derangements ⋮ A combinatorial proof of a result of Gessel and Greene ⋮ Permutations with extremal number of fixed points ⋮ On the (co)homology of the partition lattice and the free Lie algebra. ⋮ On the mean chromatic number

This page was built for publication: A Coloring Problem