Clique coverings of the edges of a random graph

DOI10.1007/BF01202786zbMath0782.05072WikidataQ106026115 ScholiaQ106026115MaRDI QIDQ2367438

Béla Bollobás, Paul Erdős, Douglas B. West, J. H. Spencer

Publication date: 16 August 1993

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

clique numberrandom graphintersection numberinterval 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

The intersection number of complete r-partite graphs, Covering the edges of a random hypergraph by cliques, Covering the edges of a random graph by cliques, Dot product representations of graphs, On the double competition number, On the kernel size of clique cover reductions for random intersection graphs, Onk-ordered graphs, On the intersection number of a graph

Cites Work

• On the interval number of random graphs
• A note on the interval number of a graph
• Extremal values of the interval number of a graph, II
• An improved edge bound on the interval number of a graph
• Extremal Values of the Interval Number of a Graph
• The Representation of a Graph by Set Intersections