On covering numbers of regular hypergraphs

MaRDI QIDQ1369334zbMATH OpenFDO

Authors Bernhard Rupp

Publication date 22 February 1998

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

covering numberregular hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Covering the edges of a random hypergraph by cliques
• On the vertex cover number of 3-uniform hypergraph
• Bounding the vertex cover number of a hypergraph
• Extensions of Gallai's graph covering theorems for uniform hypergraphs
• On a problem of Erdős and Moser

Cited in

(12)

• Partial covering of hypergraphs
• The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks
• On the vertex cover number of 3-uniform hypergraph
• Sets defining minimal vertex covers of uniform hypergraphs.
• Covering and tiling hypergraphs with tight cycles
• scientific article; zbMATH DE number 3887743 (Why is no real title available?)
• scientific article; zbMATH DE number 3931058 (Why is no real title available?)
• Near perfect coverings in graphs and hypergraphs
• On the Fractional Covering Number of Hypergraphs
• Non-regular graph coverings and lifting the hyperelliptic involution
• Some computational aspects of solvable regular covers of graphs
• scientific article; zbMATH DE number 4087673 (Why is no real title available?)

This page was built for publication: On covering numbers of regular hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369334)