Universal cycles of (n - 1)-partitions of an n-set
From MaRDI portal
Recommendations
- Universal and near-universal cycles of set partitions
- Universal cycles for combinatorial structures
- Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
- On Universal Cycles for k-Subsets of an n-Set
- On universal cycles for new classes of combinatorial structures
Cites work
- scientific article; zbMATH DE number 894522 (Why is no real title available?)
- scientific article; zbMATH DE number 3068971 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- A problem in arrangements
- Multicover Ucycles
- Normal Recurring Decimals
- Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
- Universal cycles for combinatorial structures
- Universal cycles of k-subsets and k-permutations
Cited in
(8)- On Universal Cycles for k-Subsets of an n-Set
- Rooted cyclic permutations of lattice paths and uniform partitions
- Universal cycles for combinatorial structures
- Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
- An explicit universal cycle for the (n-1)-permutations of an n-set
- Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
- Universal and near-universal cycles of set partitions
- On universal cycles for multisets
This page was built for publication: Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044896)
