Covering the edges of a random hypergraph by cliques
From MaRDI portal
(Redirected from Publication:2158205)
Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Random graphs (graph-theoretic aspects) (05C80)
Recommendations
Cites work
- Clique coverings of the edges of a random graph
- Covering the edges of a random graph by cliques
- Covers in hypergraphs
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Nearly perfect matchings in regular simple hypergraphs
- On the method of typical bounded differences
- Prague dimension of random graphs
- Probabilistic methods for algorithmic discrete mathematics
Cited in
(7)- Extension of a clique cover result to uniform hypergraphs
- On covering numbers of regular hypergraphs
- Covering the edges of a random graph by cliques
- Clique coverings of the edges of a random graph
- scientific article; zbMATH DE number 3931058 (Why is no real title available?)
- On the clique number of a random overlap graph
- Some results and problems on clique coverings of 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)
