4一致C-超图的最小边数的上界(英文)  

Upper Bounds on Minimum Number of C-edges of 4-Uniform C-Hypergraphs

作　　者：刁科凤[1] 刘桂真[1] 

机构地区：[1]山东大学数学与系统科学学院

出　　处：《应用数学》2004年第4期623-628,共6页Mathematica Applicata

基　　金：SupportedbyNNSF(6 0 172 0 0 3) ,NSF(Z2 0 0A0 2 )ofShangdongProvinceofChina

摘　　要：主要讨论了 4一致C 超图的最小边数与最小上色数的关系 ,给出了上色数为 3的 4一致C 超图的最小边数的一个上界 .The upper chromatic number (H) of a C-hypergraph H=(X,C) is the maximum number of colors that can be assigned to the vertices of H in such a way that each C∈C contains a monochromatic pair of vertices.It is closely related to the number of C-edges.In this paper discusses the relationship between the lower bound of the size of C-edges and the lower bound of the upper chromatic number is discussed and an upper bound of minimum number C-edges of 4-uniform C-hypergraphs with minimum upper chromatic number is given.

关 键 词：混合超图 严格染色 上色数 点对图 

分 类 号：O157.5[理学—数学]