The covering radius problem for sets of 1-factors of the complete uniform hypergraphs

DOI10.1016/j.disc.2015.01.014zbMath1371.05196arXiv1009.0810OpenAlexW1970668075MaRDI QIDQ2407022

Alan J. Aw, Cheng Yeaw Ku

Publication date: 28 September 2017

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

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

zbMATH Keywords

covering radiushypergraphsfinite metric spacesprobabilistic methods

Mathematics Subject Classification ID

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

Related Items (1)

The multicovering radius problem for some types of discrete structures

Cites Work

• Unnamed Item
• Unnamed Item
• Remoteness of permutation codes
• A random construction for permutation codes and the covering radius
• Covering radius for sets of permutations
• The multicovering radius problem for some types of discrete structures
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Covering radius---Survey and recent results
• The multicovering radii of codes

This page was built for publication: The covering radius problem for sets of 1-factors of the complete uniform hypergraphs