|
|||||
|
|
| 一个子集树研究问题的解 | |
| 引用本文： | 巫世权.一个子集树研究问题的解[J].高校应用数学学报(英文版),1994,9(2):149-152. |
| 作者姓名： | 巫世权 |
| 摘 要： | In this paper, we solve a research problem on trees of subsets posed by F.R. McMorris. If a collection of subsets are chosen at random from the power set of a finite set X,we give the probability that the collection is a tree of subsets of X. |
| 关 键 词： | 子集树 图论 有限集 非负整数 |
| 本文献已被 维普 等数据库收录！ | |