Covering the edges of a random hypergraph by cliques
DOI10.7151/dmgt.2431zbMath1495.05200OpenAlexW3200491929MaRDI QIDQ2158205
Andrzej Ruciński, Vojtěch Rödl
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
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Probabilistic methods for algorithmic discrete mathematics
- Nearly perfect matchings in regular simple hypergraphs
- Covers in 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
- Prague dimension of random graphs
This page was built for publication: Covering the edges of a random hypergraph by cliques
