Covering the edges of a random hypergraph by cliques

DOI10.7151/DMGT.2431zbMATH Open1495.05200OpenAlexW3200491929MaRDI QIDQ2158205FDOQ2158205

Authors: Vojtěch Rödl, Andrzej Ruciński 

Publication date: 26 July 2022

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2431

Recommendations

• Clique coverings of the edges of a random graph
• Covering the edges of a random graph by cliques
• Multicovering hypergraphs
• scientific article; zbMATH DE number 3931058
• Near perfect coverings in graphs and hypergraphs

zbMATH Keywords

representation numberclique coveringuniform random hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Probabilistic methods for algorithmic discrete mathematics
• Nearly perfect matchings in regular simple hypergraphs
• Covering the edges of a random graph by cliques
• Clique coverings of the edges of a random graph
• On the Method of Typical Bounded Differences
• Covers in hypergraphs
• Prague dimension of random graphs

Cited In (5)

• Covering the edges of a random graph by cliques
• Some results and problems on clique coverings of hypergraphs
• On the clique number of a random overlap graph
• Title not available (Why is that?)
• Extension of a clique cover result to uniform hypergraphs

This page was built for publication: Covering the edges of a random hypergraph by cliques

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