（m，n）－树的次集和次序列

DEGREE SETS AND DEGREE SEQUENCES OF (m,n)-TREES

定义了（ｍ，ｎ）－树的次集和次序列的概念，并且定义一个集Ｄ是（ｍ，ｎ）－可实现的如果Ｄ是某个（ｍ，ｎ）－树的次集．证明了：如果Ｄ是具有最大元素ｄ的数集，则对某个ｋ’，ｋ’≥（ｄ－１）δ是（ｋ’－δ，ｋ’）－可实现的当且仅当Ｄ有一个实现是一个具有ｄ个极大单形的（ｄδ－δ－１，ｄδ－１）－树，并且对任意ｋ≥（ｄ－１）δ，Ｄ也是（ｋ－δ。

The degree set and degree sequence of an (m,n)-tree are difined. An integer set D is said to be (m,n)-realized if D is precisely the degree set of an (m,n)-tree. It is proved that if d is the most number of an integer set D,then for some k'≥ (d-1)δ,D is (k' -δ,k' )-realiZed if and only if D is (dδ-δ- 1,dδ- 1)-realized by a (dδ-δ- 1,dδ- 1)-tree with d maximum simplexes and for any k≥ (d - 1 )δ, D is also (k - δ, k )-realized,where δ=n-m.