Universal cycles for combinatorial structures

DOI10.1016/0012-365X(92)90699-GzbMATH Open0776.05001OpenAlexW2085157194WikidataQ29041464 ScholiaQ29041464MaRDI QIDQ1208348FDOQ1208348

Authors: Persi Diaconis, Fan Chung, Ron Graham

Publication date: 16 May 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90699-g

Recommendations

Universal cycles of \(k\)-subsets and \(k\)-permutations
Universal cycles of complementary classes
On Universal Cycles for k-Subsets of an n-Set
Universal cycles for permutations
Universal cycles of \((n - 1)\)-partitions of an \(n\)-set

zbMATH Keywords

partitions permutations universal cycle De Bruijn cycles

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Partitions of sets (05A18) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

Cited In (81)

On uniquely \(k\)-determined permutations
Harmonious and achromatic colorings of fragmentable hypergraphs
Binary bubble languages and cool-lex order
A universal cycle for strings with fixed-content (which are also known as multiset permutations)
Locating patterns in the de Bruijn torus
The lexicographically smallest universal cycle for binary strings with minimum specified weight
An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
On Universal Cycles for k-Subsets of an n-Set
Universal cycles of classes of restricted words
Quasi-Eulerian hypergraphs
A recursive construction for universal cycles of 2-subspaces
Minimum Eulerian circuits and minimum de Bruijn sequences
Universal cycles for permutations
Universal sets and the vector game
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
The feasible region for consecutive patterns of permutations is a cycle polytope
Universal and overlap cycles for posets, words, and juggling patterns
Packing analogue of \(k\)-radius sequences
Graph universal cycles of combinatorial objects
Cycles in the graph of overlapping permutations avoiding barred patterns
Shorthand universal cycles for permutations
De Bruijn sequences for the binary strings with maximum density
The existence of \(k\)-radius sequences
Universal cycles of \(k\)-subsets and \(k\)-permutations
Designing preference functions for de Bruijn sequences with forbidden words
The combinatorics of binary arrays
Number of cycles in the graph of 312-avoiding permutations
On universal partial words
Universal partial words over non-binary alphabets
Generalized de Bruijn words for primitive words and powers
Universal juggling cycles
Graph universal cycles: compression and connections to universal cycles
Universal traversal sequences for paths and cycles
On universal cycles for new classes of combinatorial structures
Contributions to the theory of de Bruijn cycle
Hamiltonian paths in Cayley graphs
Computing generalized de Bruijn sequences
Euler tours in hypergraphs
Enumerating cycles in the graph of overlapping permutations
Efficient universal cycle constructions for weak orders
On the de Bruijn torus problem
Universal Cycles of Discrete Functions
On universal cycles of labeled graphs
Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
A new universal cycle for permutations
Path-sequential labellings of cycles
Faster generation of shorthand universal cycles for permutations
de Bruijn sequences and de Bruijn graphs for a general language
Universal and near-universal cycles of set partitions
Universal cycles for permutation classes
Universal cycles for weak orders
On universal cycles for multisets
Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
Growing perfect cubes
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
Multicover Ucycles
Universal cycles of complementary classes
Graphs with the unique path property: Structure, cycles, factors, and constructions
On shortening \(u\)-cycles and \(u\)-words for permutations
An embedding technique in the study of word-representability of graphs
Overlap cycles for Steiner quadruple systems
Constructing the first (and coolest) fixed-content universal cycle
The k-centre problem for classes of cyclic words
Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
New classes of perfect maps. I
Equivalence class universal cycles for permutations
1-overlap cycles for Steiner triple systems
A tight upper bound on the length of maximal bordered box repetition-free words
Containing all permutations
Short k‐radius sequences, k‐difference sequences and universal cycles
On a family of universal cycles for multi-dimensional permutations
The feasible region for consecutive patterns of permutations is a cycle polytope
Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
Properties of the cycles that contain all vectors of weight \(\le k\)
Cycle decompositions in \(k\)-uniform hypergraphs
On a greedy algorithm to construct universal cycles for permutations
Euler's theorem for regular CW-complexes
Gray cycles of maximum length related to \(k\)-character substitutions
Shortened universal cycles for permutations
Enumerations of universal cycles for \(k\)-permutations

This page was built for publication: Universal cycles for combinatorial structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208348)