• DOI:10.1016/0020-0190(92)90181-T
Corpus ID: 1402659

Improved Bounds for Covering Complete Uniform Hypergraphs

@article{Radhakrishnan1992ImprovedBF,
  title={Improved Bounds for Covering Complete Uniform Hypergraphs},
  author={J. Radhakrishnan},
  journal={Inf. Process. Lett.},
  year={1992},
  volume={41},
  pages={203-207}
}

J. Radhakrishnan

Published 1992

Mathematics, Computer Science

Inf. Process. Lett.

View via Publisher

tcs.tifr.res.in

Save to Library

Create Alert

Cite

Launch Research Feed

Abstract We consider the problem of covering the complete r-uniform hypergraphs on n vertices using complete r-partite graphs. We obtain lower bounds on the size of such a covering. For small values of r our result implies a lower bound of Ω(( e r r r )n log n) on the size of any such covering. This improves the previous bound of Ω(rn log n) due to Snir. We also obtain good lower bounds on the size of a family of perfect hash function using simple arguments.