摘要
讨论了平面上含有n个点的点集S的k—子集的最多个数求值问题。通过对问题的模型方式处理,得到了一个有益的结果。
The maximum number of k —subsets of a set of n points in a plane has been discussed. A result has been obtained by means of model analysis.
出处
《山东建筑工程学院学报》
1998年第3期82-84,共3页
Journal of Shandong Institute of Architecture and Engineering