用团覆盖随机图的边
组合数学
2011-03-28 v1
摘要
图G的团覆盖数是覆盖图G的所有边所需的最少团数。本文考虑常数p的随机图G(n,p)。我们证明，以概率1-o(1)，G(n,p)的团覆盖数为Θ(n^2/log^2n)。
引用
@article{arxiv.1103.4870,
title = {Covering the edges of a random graph by cliques},
author = {Alan Frieze and Bruce Reed},
journal= {arXiv preprint arXiv:1103.4870},
year = {2011}
}
备注
This paper was published some time ago in Combinatorica 15 (1995) pp1-9. Reza Akhtar found an error in our proof. This version fixes the error and we take advantage of the arXiv to publish a complete correct version