Universal cycles of \((n - 1)\)-partitions of an \(n\)-set

DOI10.1016/j.disc.2009.03.002zbMath1207.05004OpenAlexW2094047170MaRDI QIDQ1044896

Brett Stevens, Karel Casteels

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.002

zbMATH Keywords

permutationsset partitionsuniversal cyclescombinatorial orderings

Mathematics Subject Classification ID

Partitions of sets (05A18) Permutations, words, matrices (05A05)

Related Items

Universal and near-universal cycles of set partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Universal cycles for combinatorial structures
• Multicover Ucycles
• Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• A problem in arrangements
• Normal Recurring Decimals