On Universal Cycles for k-Subsets of an n-Set
From MaRDI portal
Publication:4317705
Recommendations
- An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
- Universal cycles of k-subsets and k-permutations
- On universal cycles for multisets
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
- Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
- Universal and near-universal cycles of set partitions
- Near-universal cycles for subsets exist
- On universal cycles for new classes of combinatorial structures
- An explicit universal cycle for the (n-1)-permutations of an n-set
- Universal cycles for combinatorial structures
Cited in
(26)- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
- Universal cycles of classes of restricted words
- A recursive construction for universal cycles of 2-subspaces
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Universal sets and the vector game
- Universal and overlap cycles for posets, words, and juggling patterns
- Packing analogue of k-radius sequences
- Graph universal cycles of combinatorial objects
- Cyclic sequences of k-subsets with distinct consecutive unions
- The existence of \(k\)-radius sequences
- Universal cycles of k-subsets and k-permutations
- Arrangements of \(k\)-sets with intersection constraints
- Universal cycles for combinatorial structures
- Short k‐radius sequences, k‐difference sequences and universal cycles
- Near-universal cycles for subsets exist
- On universal cycles for new classes of 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
- Euler tours in hypergraphs
- 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
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
- Multicover Ucycles
This page was built for publication: On Universal Cycles for k-Subsets of an n-Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4317705)
