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

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Covering and packing problems constitute a class of questions concerning finite metric spaces that have surfaced in recent literature. In this paper, we consider, for the first time, these problems for the finite metric space (Ω,d) arising from the set Ω of 1-factors of the complete t-uniform hypergraph H on nt vertices for some positive integers n and t. We focus on the covering problem; in particular we investigate bounds on the covering radius of any code C Ω. In doing so, we give both upper and lower bounds on the covering radius, as well as a frequency parameter type result that follows from the Lovász local lemma.

Cite

CITATION STYLE

APA

Aw, A. J., & Ku, C. Y. (2015). The covering radius problem for sets of 1-factors of the complete uniform hypergraphs. Discrete Mathematics, 338(6), 875–884. https://doi.org/10.1016/j.disc.2015.01.014

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free