北京师范大学学报（自然科学版）2018，Vol.54Issue(2)：165-171,7.DOI:10.16360/j.cnki.jbnuns.2018.02.003
广义r-部完全超图的边色数
The edge coloring number of generalized complete r-partitioned hypergraph
摘要
Abstract
A hypergraph H is said to be a generalized complete r-partitioned hypergraph, denoted by Kt1,to,…,tn1,n2,…n, If its vertex set X endows with a partition X1, X2,…,Xr, i. e., for all i≠j,Xi∩Xj=()(1≤I,j≤ r), X=∪i=1 Xi.|Xi|=ni(1≤i≤r). The edge set E consists of all distinct subsets E' of X such that |E'∩ Xi|= ti(l≤ti≤ni,l≤i≤r). This article considers the edge coloring number of generalized complete r-partitioned hypergraph. Based on the edge coloring of complete r-partite hypergraph and complete t-uniform hypergraph, the edge chromatic number of special generalized complete r-partitioned hypergraph has been found. The upper bound on the edge chromatic number of generalized complete r-partitioned hypergraph is given, which extends edge chromatic number in complete r-partite hypergraph and complete t-uniform hypergraph.关键词
r-部完全超图/t-一致完全超图/r-广义部完全超图/边色数Key words
complete r-partite hypergraph/complete t-uniform hypergraph/generalized complete r-partitioned hypergraph/edge chromatic number分类
数理科学引用本文复制引用
王娜,张雁楠,蔡俊亮,陈星..广义r-部完全超图的边色数[J].北京师范大学学报（自然科学版）,2018,54(2):165-171,7.基金项目
国家自然科学基金资助项目(11301452,11571044,11371133) （11301452,11571044,11371133）
自治区高校科研计划资助项目(XJEDU2016S097) （XJEDU2016S097）
