Improved bounds for covering complete uniform hypergraphs

DOI10.1016/0020-0190(92)90181-TzbMath0770.05077MaRDI QIDQ1190514

No author found.

Publication date: 26 September 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

coveringhypergraphslower boundsperfect hash function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

\(\Sigma\Pi\Sigma\) threshold formulas ⋮ Better lower bounds for monotone threshold formulas ⋮ Bipartite Hansel results for hypergraphs ⋮ Cores of random \(r\)-partite hypergraphs ⋮ Optimal linear perfect hash families

Cites Work

• The covering problem of complete uniform hypergraphs
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Fredman–Komlós bounds and information theory

This page was built for publication: Improved bounds for covering complete uniform hypergraphs