Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
From MaRDI portal
Publication:503623
DOI10.1007/s00373-016-1727-6zbMath1353.05008OpenAlexW2478466677WikidataQ59473460 ScholiaQ59473460MaRDI QIDQ503623
Publication date: 13 January 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-016-1727-6
Permutations, words, matrices (05A05) Combinatorial aspects of tessellation and tiling problems (05B45) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Omnibus sequences, coupon collection, and missing word counts
- The existence of \(k\)-radius sequences
- Constructions of asymptotically shortest \(k\)-radius sequences
- Universal cycles of \(k\)-subsets and \(k\)-permutations
- Universal cycles of classes of restricted words
- Universal cycles for permutations
- On universal cycles for multisets
- A recursive construction for universal cycles of 2-subspaces
- Research problems on Gray codes and universal cycles
- Universal cycles for combinatorial structures
- Multicover Ucycles
- Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
- Generalized de Bruijn cycles
- An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n\)]
- Distinctness of compositions of an integer: A probabilistic analysis
- Universal Cycles for Weak Orders
- s-Overlap Cycles for Permutations
- On Universal Cycles for new Classes of Combinatorial Structures
- Near-Universal Cycles for Subsets Exist
- On Universal Cycles for k-Subsets of an n-Set
- On the Multiplicity of Parts in a Random Composition of a Large Integer
- Combinatorics of Compositions and Words
- Overlap Cycles for Permutations: Necessary and Sufficient Conditions
This page was built for publication: Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
