Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
type: Item
instance of: scholarly article
title: Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
zbMATH Open document ID: 1353.05008
author: Zbigniew Lonc
author: Michał Dębski
published in: Graphs and Combinatorics
publication date: 2017-01-13T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 94B99
zbMATH DE Number: 6674431
zbMATH Keywords: universal cycle
zbMATH Keywords: ucycle packing
zbMATH Keywords: ucycle covering
MaRDI profile type: Publication
full work available at URL: s00373-016-1727-6
OpenAlex ID: W2478466677
Wikidata QID: Q59473460
cites work: Omnibus sequences, coupon collection, and missing word counts
cites work: The existence of \(k\)-radius sequences
cites work: On Universal Cycles for new Classes of Combinatorial Structures
cites work: A recursive construction for universal cycles of 2-subspaces
cites work: Universal cycles for combinatorial structures
cites work: Generalized de Bruijn cycles
cites work: Near-Universal Cycles for Subsets Exist
cites work: Q3015618
cites work: Combinatorics of Compositions and Words
cites work: Distinctness of compositions of an integer: A probabilistic analysis
cites work: On the Multiplicity of Parts in a Random Composition of a Large Integer
cites work: Overlap Cycles for Permutations: Necessary and Sufficient Conditions
cites work: s-Overlap Cycles for Permutations
cites work: Universal cycles for weak orders
cites work: On Universal Cycles for k-Subsets of an n-Set
cites work: Multicover Ucycles
cites work: On universal cycles for multisets
cites work: Universal cycles of \(k\)-subsets and \(k\)-permutations
cites work: Research problems on Gray codes and universal cycles
cites work: Constructions of asymptotically shortest \(k\)-radius sequences
cites work: Universal cycles for permutations
cites work: Q5492593
cites work: Universal cycles of classes of restricted words
cites work: Q3335022
cites work: An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
cites work: Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
DOI: 10.1007/S00373-016-1727-6
Recommended article: On Universal Cycles for k-Subsets of an n-Set
Recommended article: Universal cycles of \(k\)-subsets and \(k\)-permutations
Recommended article: An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
Recommended article: Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
Recommended article: Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
Recommended article: Q3829583
Recommended article: Universal and near-universal cycles of set partitions
Recommended article: On universal cycles for multisets
Recommended article: Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles
Recommended article: Cycle packings of the complete multigraph
description: scientific article; zbMATH DE number 6674431