Improved bounds for covering complete uniform hypergraphs
type: Item
instance of: scholarly article
title: Improved bounds for covering complete uniform hypergraphs
zbMATH Open document ID: 0770.05077
DOI: 10.1016/0020-0190(92)90181-T
published in: Information Processing Letters
publication date: 1992-09-26T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 55565
zbMATH Keywords: covering
zbMATH Keywords: hypergraphs
zbMATH Keywords: lower bounds
zbMATH Keywords: perfect hash function
MaRDI profile type: Publication
cites work: On the Size of Separating Systems and Families of Perfect Hash Functions
cites work: Fredman–Komlós bounds and information theory
cites work: The covering problem of complete uniform hypergraphs
Recommended article: Q4737227
Recommended article: Approximate Set Covering in Uniform Hypergraphs
Recommended article: Covering non-uniform hypergraphs
Recommended article: Extensions of Gallai's graph covering theorems for uniform hypergraphs
Recommended article: Extension of a clique cover result to uniform hypergraphs
Recommended article: Improved upper bounds for vertex cover
Recommended article: Improved Upper Bounds for Partial Vertex Cover
Recommended article: Improved bounds for the Graham-Pollak problem for hypergraphs
Recommended article: Near perfect coverings in graphs and hypergraphs
Recommended article: Improved Bounds for Uniform Hypergraphs without Property B
author: Jaikumar Radhakrishnan
description: scientific article; zbMATH DE number 55565