应用数学2004，Vol.17Issue(4)：623-628,6.
4一致(ξ)-超图的最小边数的上界
Upper Bounds on Minimum Number of (ξ) edges of 4-(ξ)Uniform Hypergraphs
摘要
Abstract
The upper chromatic number (-x) (H) of a l- hypergraph H = (X, l) is the maximum number of colors that can be assigned to the vertices of H in such a way that each C ∈ l contains a monochromatic pair of vertices. It is closely related to the number of l- edges. In this paper discusses the relationship between the lower bound of the size of l- edges and the lower bound of the upper chromatic number is discussed and an upper bound of minimum number l- edges of 4-uniform l- hypergraphs with minimum upper chromatic number is given.关键词
混合超图/严格染色/上色数/点对图两相渗流驱动问题的Key words
l- hypergraph/Strict coloring/Upper chromatic number/Pair graph分类
数理科学引用本文复制引用
刁科凤,刘桂真..4一致(ξ)-超图的最小边数的上界[J].应用数学,2004,17(4):623-628,6.基金项目
Supported by NNSF(60172003),NSF(Z200A02)of Shangdong Province of China （60172003）
