Universal and Near-Universal Cycles of Set Partitions

[摘要] We study universal cycles of the set $\mathcal{P}(n,k)$ of $k$-partitions of the set $[n]:=\{1,2,\ldots,n\}$ and prove that the transition digraph associated with $\mathcal{P}(n,k)$ is Eulerian. But this does not imply that universal cycles (or ucycles) e

[学科分类] 离散数学和组合数学

[关键词] Set partitions;Universal cycles;Packings;Coverings