CSpace
MAXIMUM TREES OF SUBSETS
WU, SQ
1994
Source PublicationACTA MATHEMATICA SCIENTIA
ISSN0252-9602
Volume14Issue:1Pages:39-42
AbstractLet X be a finite set and P the collection of all nonempty proper subsets of X. A subset F of P is called a tree of subsets of X if A,B is-an-element-of F implies A and B is-an-element-of {empty set, A,B}. In this paper, the maximum trees of subsets of a finite set are obtained.
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:A1994NV34000005
PublisherBALTZER SCI PUBL BV
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/28187
Collection中国科学院数学与系统科学研究院
AffiliationCHINESE ACAD SCI,INST APPL MATH,BEIJING 100080,PEOPLES R CHINA
Recommended Citation
GB/T 7714
WU, SQ. MAXIMUM TREES OF SUBSETS[J]. ACTA MATHEMATICA SCIENTIA,1994,14(1):39-42.
APA WU, SQ.(1994).MAXIMUM TREES OF SUBSETS.ACTA MATHEMATICA SCIENTIA,14(1),39-42.
MLA WU, SQ."MAXIMUM TREES OF SUBSETS".ACTA MATHEMATICA SCIENTIA 14.1(1994):39-42.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[WU, SQ]'s Articles
Baidu academic
Similar articles in Baidu academic
[WU, SQ]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[WU, SQ]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.