Some results and problems on clique coverings of hypergraphs

DOI10.1002/JGT.23111MaRDI QIDQ6606330zbMATH OpenFDO

Authors Vojtěch Rödl, Marcelo Tadeu Sales

Publication date 16 September 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

hypergraphsindependent setsclique coveringset representation

Mathematics Subject Classification ID

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

Recommendations

• Extension of a clique cover result to uniform hypergraphs
• Covering the edges of a random hypergraph by cliques
• Approximation Algorithms for the k-Clique Covering Problem
• scientific article; zbMATH DE number 3896979
• Codegree thresholds for covering 3-uniform hypergraphs

Cites work

• Coloured and directed designs
• Covering graphs by the minimum number of equivalence relations
• Covering the edges of a random hypergraph by cliques
• Covers in hypergraphs
• Graphs of small dimensions
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• The Representation of a Graph by Set Intersections
• The minimum independence number for designs

This page was built for publication: Some results and problems on clique coverings of hypergraphs

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