Universal cycles of k-subsets and k-permutations
From MaRDI portal
Recommendations
Cited in
(40)- Locating patterns in the de Bruijn torus
- 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]\)
- On shortening u-cycles and u-words for permutations
- On Universal Cycles for k-Subsets of an n-Set
- Universal cycles of classes of restricted words
- A recursive construction for universal cycles of 2-subspaces
- Universal cycles for permutations
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Universal and overlap cycles for posets, words, and juggling patterns
- Packing analogue of k-radius sequences
- Universal limits of substitution-closed permutation classes
- Graph universal cycles of combinatorial objects
- Classifying rotationally-closed languages having greedy universal cycles
- Constructing the first (and coolest) fixed-content universal cycle
- Cyclic sequences of k-subsets with distinct consecutive unions
- Equivalence class universal cycles for permutations
- The existence of \(k\)-radius sequences
- Containing all permutations
- Hamiltonicity of digraphs for universal cycles of permutations
- Universal cycles for combinatorial structures
- Short k‐radius sequences, k‐difference sequences and universal cycles
- On universal cycles for new classes of combinatorial structures
- Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
- Universal juggling cycles
- Contributions to the theory of de Bruijn cycle
- 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
- A new universal cycle for permutations
- Faster generation of shorthand universal cycles for permutations
- Universal cycles for permutation classes
- On universal cycles for multisets
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
- On a greedy algorithm to construct universal cycles for permutations
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
- Shortened universal cycles for permutations
- Multicover Ucycles
- Enumerations of universal cycles for \(k\)-permutations
- Extension of universal cycles for globally identifying colorings of cycles
This page was built for publication: Universal cycles of \(k\)-subsets and \(k\)-permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686158)
