Covering the edges of a random graph by cliques

DOI10.1007/BF01192522zbMath0839.05084arXiv1103.4870OpenAlexW1996983751WikidataQ57401569 ScholiaQ57401569MaRDI QIDQ1906846

Bruce A. Reed, Alan M. Frieze

Publication date: 5 June 1996

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.4870

zbMATH Keywords

random graphclique cover number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

The intersection number of complete r-partite graphs ⋮ Covering the edges of a random hypergraph by cliques ⋮ On the double competition number ⋮ On the kernel size of clique cover reductions for random intersection graphs ⋮ Kneser Ranks of Random Graphs and Minimum Difference Representations ⋮ On the intersection number of a graph ⋮ On set intersection representations of graphs ⋮ The concentration of the chromatic number of random graphs

Cites Work

• Asymptotic behavior of the chromatic index for hypergraphs
• Clique coverings of the edges of a random graph

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