102
click to vote
COMBINATORICS
2000
15 years 3 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...