Universal cycles of k-subsets and k-permutations

DOI10.1016/0012-365X(93)90330-VzbMATH Open0783.05001MaRDI QIDQ686158FDOQ686158

Authors Bradley W. Jackson 

Publication date 10 March 1994

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

euleriandigraphuniversal cycle\(k\)-permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Universal cycles for combinatorial structures
• An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
• On Universal Cycles for k-Subsets of an n-Set
• Graph universal cycles of combinatorial objects
• Enumerations of universal cycles for \(k\)-permutations

Cites work

• Graph theory with applications
• Universal cycles for combinatorial structures

Cited in

(40)

• Shortened universal cycles for permutations
• Hamiltonicity of digraphs for universal cycles of permutations
• Locating patterns in the de Bruijn torus
• Graph universal cycles of combinatorial objects
• Constructing the first (and coolest) fixed-content universal cycle
• Universal cycles for combinatorial structures
• Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
• A new universal cycle for permutations
• Classifying rotationally-closed languages having greedy universal cycles
• An explicit universal cycle for the \((n-1)\)-permutations of an \(n\)-set
• Contributions to the theory of de Bruijn cycle
• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• Cyclic sequences of \(k\)-subsets with distinct consecutive unions
• An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
• On Universal Cycles for k-Subsets of an n-Set
• Multicover Ucycles
• The existence of \(k\)-radius sequences
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• Enumerations of universal cycles for \(k\)-permutations
• Containing all permutations
• On universal cycles for multisets
• Universal juggling cycles
• Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• Universal cycles of classes of restricted words
• On a greedy algorithm to construct universal cycles for permutations
• Universal cycles for permutation classes
• Equivalence class universal cycles for permutations
• Universal cycles for permutations
• Faster generation of shorthand universal cycles for permutations
• Extension of universal cycles for globally identifying colorings of cycles
• A recursive construction for universal cycles of 2-subspaces
• Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
• On universal cycles for new classes of combinatorial structures
• On shortening \(u\)-cycles and \(u\)-words for permutations
• Universal and overlap cycles for posets, words, and juggling patterns
• Packing analogue of \(k\)-radius sequences
• Short k‐radius sequences, k‐difference sequences and universal cycles
• Universal limits of substitution-closed permutation classes
• Euler tours in hypergraphs

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)