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.
  • 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. 
    21 Citations

    Topics from this paper

    Cores of random r-partite hypergraphs
    • 14
    • PDF
    Splitters and near-optimal derandomization
    • 292
    • PDF
    Better Lower Bounds for Monotone Threshold Formulas
    • 13
    • PDF
    Bipartite Hansel results for hypergraphs
    Dispersing hash functions
    • 1
    Efficient Minimal Perfect Hashing in Nearly Minimal Space
    • 80
    Simple and Space-Efficient Minimal Perfect Hash Functions
    • 105
    • PDF
    Optimal Linear Perfect Hash Families
    • 48
    • Highly Influenced
    • PDF
    Dispersing hash functions
    • R. Pagh
    • Computer Science, Mathematics
    • Random Struct. Algorithms
    • 2000
    • 5
    • PDF
    External perfect hashing for very large key sets
    • 58
    • PDF

    References

    SHOWING 1-7 OF 7 REFERENCES
    The covering problem of complete uniform hypergraphs
    • M. Snir
    • Mathematics, Computer Science
    • Discret. Math.
    • 1979
    • 13
    • PDF
    Fredman-Kolmo´s bounds and information theory
    • 91
    Perfect hashing, graph entropy, and circuit complexity
    • 32
    • PDF
    ΣΠΣ Threshold Formulas
    • 6
    • PDF
    Fredman-Komlós Bound and Information Theory
    • SIAM J. Alg. Disc. Meth
    • 1986
    On the Size of Separating Systems and Perfect Hash Functions
    • SIAM J. Alg. Disc. Meth
    • 1985