On Universal Cycles for k-Subsets of an n-Set
From MaRDI portal
Publication:4317705
DOI10.1137/S0895480191220861zbMath0810.05012OpenAlexW2005183185MaRDI QIDQ4317705
Publication date: 20 December 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480191220861
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Paths and cycles (05C38) Other designs, configurations (05B30) Enumerative combinatorics (05A99) Eulerian and Hamiltonian graphs (05C45)
Related Items (17)
Universal and overlap cycles for posets, words, and juggling patterns ⋮ Packing analogue of \(k\)-radius sequences ⋮ Multicover Ucycles ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Euler tours in hypergraphs ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ Universal and near-universal cycles of set partitions ⋮ An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n\)] ⋮ Arrangements of \(k\)-sets with intersection constraints ⋮ The existence of \(k\)-radius sequences ⋮ Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set ⋮ Universal cycles of classes of restricted words ⋮ Graph universal cycles of combinatorial objects ⋮ On universal cycles for multisets ⋮ A recursive construction for universal cycles of 2-subspaces ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
This page was built for publication: On Universal Cycles for k-Subsets of an n-Set