Some results and problems on clique coverings of hypergraphs

DOI10.1002/JGT.23111zbMATH Open1547.05242MaRDI QIDQ6606330FDOQ6606330

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)

Cites Work

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

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)