Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
From MaRDI portal
Publication:3117226
DOI10.1090/S0025-5718-2011-02473-7zbMath1236.05020arXiv1008.1608MaRDI QIDQ3117226
Yeow Meng Chee, San Ling, Yin Tan, Xian De Zhang
Publication date: 17 February 2012
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.1608
Steiner triple system; group divisible design; alternating Hamiltonian cycle; block intersection graph; minimum covering; universal cycle; sequence of radius two
05B05: Combinatorial aspects of block designs
68R05: Combinatorics in computer science
05C38: Paths and cycles
05B07: Triple systems
05B40: Combinatorial aspects of packing and covering
Related Items
Erratum: Constructing Optimal $k$-Radius Sequences, Packing analogue of \(k\)-radius sequences, Sequences of radius \(k\) for complete bipartite graphs, The existence of \(k\)-radius sequences, Constructions of asymptotically shortest \(k\)-radius sequences, Note on a construction of short \(k\)-radius sequences, Sequences of large radius, Constructing Optimal $k$-Radius Sequences, Constructing 𝑘-radius sequences, Sequences of Radius k for Complete Bipartite Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordering block designs. Gray codes, universal cycles and configuration orderings
- Universal cycles of \(k\)-subsets and \(k\)-permutations
- Minimal coverings of pairs by triples
- An algorithm for generating subsets of fixed size with a strong minimal change property
- A new class of group divisible designs with block size three
- Universal cycles for combinatorial structures
- Group divisible designs with block-size four
- Cycles in the block-intersection graph of pairwise balanced designs
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Constructing 𝑘-radius sequences
- Towards a theory of cache-efficient algorithms
- Consecutive storage of relevant records with redundancy
- Efficient generation of the binary reflected gray code and its applications
- Hamilton cycles in block-intersection graphs of triple systems
- On Universal Cycles for k-Subsets of an n-Set
- A Survey of Combinatorial Gray Codes
- Adjacent interchange generation of combinations
- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
