摘要
设G为一个匹配数为1的极值2-均衡4-部4-图,通过引入度序列确定了所有极图的结构,证明了它们共有7个同构类,并详尽描述了各类极图的结构.
Let G be a 2-balanced 4-partite 4-uniform extremal hypergraphs with matching number 1. By introducing the de- gree sequence, the structures of all the extremal hypergraphs are determined. It is proved that the extremal hypergraphs have 7 isomorphic objects, and the structures of every isomorphic object are described in detail.
出处
《天津师范大学学报(自然科学版)》
CAS
2015年第2期24-27,共4页
Journal of Tianjin Normal University:Natural Science Edition
关键词
k-部k-图
匹配数
度序列
k-partite k-uniform hypergraph
matching number
degree sequence