An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)

zbMath1267.05014arXiv1209.4662MaRDI QIDQ1953498

Yevgeniy Rudoy

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.4662

zbMATH Keywords

products of cyclesuniversal cyclesucyclessums of cycles

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)

Related Items (2)

Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set ⋮ Graph universal cycles of combinatorial objects

Cites Work

• Universal cycles of \(k\)-subsets and \(k\)-permutations
• On universal cycles for multisets
• Universal cycles for combinatorial structures
• On Universal Cycles for k-Subsets of an n-Set
• Unnamed Item

This page was built for publication: An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)