The existence of \(k\)-radius sequences

DOI10.1016/j.jcta.2011.08.004zbMath1238.05182arXiv1101.1172OpenAlexW1665464119MaRDI QIDQ645973

Simon R. Blackburn

Publication date: 11 November 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-radius sequencematchings in quasi-random hypergraphssequence design

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Packing analogue of \(k\)-radius sequences, Sequences of Radius k for Complete Bipartite Graphs, Euler tours in hypergraphs, Short k‐radius sequences, k‐difference sequences and universal cycles, Achromatic and Harmonious Colorings of Circulant Graphs, Harmonious and achromatic colorings of fragmentable hypergraphs, Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set, Harmonious and achromatic colorings of fragmentable hypergraphs, Sequences of radius \(k\) for complete bipartite graphs, Constructing Optimal $k$-Radius Sequences, Note on a construction of short \(k\)-radius sequences, Sequences of large radius

Cites Work

• Unnamed Item
• Unnamed Item
• Constructions of asymptotically shortest \(k\)-radius sequences
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Asymptotic behavior of the chromatic index for hypergraphs
• On a packing and covering problem
• Near perfect coverings in graphs and hypergraphs
• Universal cycles for combinatorial structures
• Matchings and covers in hypergraphs
• Constructing 𝑘-radius sequences
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• Near-Universal Cycles for Subsets Exist
• Consecutive storage of relevant records with redundancy
• On Universal Cycles for k-Subsets of an n-Set
• Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations