### Abstract

The edges of the random graph (with the edge probability p=1/2) can be covered using O(n^{2}lnln n/(ln n)^{2}) cliques. Hence this is an upper bound on the intersection number (also called clique cover number) of the random graph. A lower bound, obtained by counting arguments, is (1-e{open})n^{2}/(2lg n)^{2}.

Original language | English (US) |
---|---|

Pages (from-to) | 1-5 |

Number of pages | 5 |

Journal | Combinatorica |

Volume | 13 |

Issue number | 1 |

DOIs | |

State | Published - Mar 1993 |

### Fingerprint

### Keywords

- AMS subject classification code (1991): 05C80

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Mathematics(all)

### Cite this

*Combinatorica*,

*13*(1), 1-5. https://doi.org/10.1007/BF01202786

**Clique coverings of the edges of a random graph.** / Bollobás, Béla; Erdos, Paul; Spencer, Joel; West, Douglas B.

Research output: Contribution to journal › Article

*Combinatorica*, vol. 13, no. 1, pp. 1-5. https://doi.org/10.1007/BF01202786

}

TY - JOUR

T1 - Clique coverings of the edges of a random graph

AU - Bollobás, Béla

AU - Erdos, Paul

AU - Spencer, Joel

AU - West, Douglas B.

PY - 1993/3

Y1 - 1993/3

N2 - The edges of the random graph (with the edge probability p=1/2) can be covered using O(n2lnln n/(ln n)2) cliques. Hence this is an upper bound on the intersection number (also called clique cover number) of the random graph. A lower bound, obtained by counting arguments, is (1-e{open})n2/(2lg n)2.

AB - The edges of the random graph (with the edge probability p=1/2) can be covered using O(n2lnln n/(ln n)2) cliques. Hence this is an upper bound on the intersection number (also called clique cover number) of the random graph. A lower bound, obtained by counting arguments, is (1-e{open})n2/(2lg n)2.

KW - AMS subject classification code (1991): 05C80

UR - http://www.scopus.com/inward/record.url?scp=0042213605&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042213605&partnerID=8YFLogxK

U2 - 10.1007/BF01202786

DO - 10.1007/BF01202786

M3 - Article

AN - SCOPUS:0042213605

VL - 13

SP - 1

EP - 5

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 1

ER -