Covering the edges of a random graph by cliques

Details Covering the edges of a random graph by cliques Covering the edges of a random graph by cliques

2011-03-24

arxiv.org/abs/1103.4870v1

Combinatorica 15 (1995) pp1-9

Mathematics

Combinatorics

This paper was published some time ago in Combinatorica 15 (1995) pp1-9. Reza Akhtar found an error in our proof. This version

Scientific paper

The clique cover number of a graph G is the minimum number of cliques
required to cover the edges of graph G. In this paper we consider the random
graph G(n,p), for p constant. We prove that with probability 1-o(1), the clique
number of G(n,p) is Theta(n^2/\log^2n).

Affiliated with

Also associated with

No associations

Rating

Covering the edges of a random graph by cliques does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Covering the edges of a random graph by cliques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covering the edges of a random graph by cliques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-569798