摘要： Let X be a finite set and F the collection of all nonempty proper subsets of X. A subset F of F is called a tree of subsets of X if A,B ∈F implies A ∩ B ∈ {∅,A,B}. In this paper, the maximum trees of subsets of a finite set are obtained.
巫世权. MAXIMUM TREES OF SUBSETS[J]. 数学物理学报(英文版), 1994, 14(1): 39-42.
Wu Shiquan. MAXIMUM TREES OF SUBSETS[J]. Acta mathematica scientia,Series B, 1994, 14(1): 39-42.