The existence of \(k\)-radius sequences

DOI10.1016/j.jcta.2011.08.004zbMath1238.05182arXiv1101.1172MaRDI 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 sequence; matchings in quasi-random hypergraphs; sequence design

Mathematics Subject Classification ID

05C65: Hypergraphs

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

Related Items

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

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