MAXIMUM TREES OF FINITE SEQUENCES
MAXIMUM TREES OF FINITE SEQUENCES作者机构:Center for Mathematical Sciences Zhejiang University Hangzhou
出 版 物:《Applied Mathematics(A Journal of Chinese Universities)》 (高校应用数学学报(英文版)(B辑))
年 卷 期:1995年第10卷第2期
页 面:223-228页
核心收录:
学科分类:07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题:Tree of subsets finite sequences tree of finite sequences.
摘 要:Let n, s1, s2,..., sn be non-negative integers and M(s1, s2,...,sn) ={(a1, a2,..., a.)| ai is an integer and 0≤ai ≤si for each i}. In this paper, the cardinality of maximum trees of finite sequences in M(s1, s2,..., sn) sn) is obtained, which generalizes some of Frankl s results on families of finite sets with prescribed cardinalities for pairwise intersections.