Title

Clique coverings of the edges of a random graph

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 . © 1993 Akadémiai Kiadó.

Publication Title

Combinatorica

Share

COinS