搜索结果: 1-1 共查到“运筹学 Cliques”相关记录1条 . 查询时间(0.046 秒)
Let kr(n, δ) be the minimum number of r-cliques in graphs with n vertices and minimum degree δ. We evaluate kr(n, δ) for δ ≤ 4n/5 and some other cases. Moreover, we give a construction, which we conje...