-
58浏览
-
0点赞
-
0收藏
-
0分享
-
63下载
-
0评论
-
引用
期刊论文
Bounds on Minimum C-Edge Number of 4-Uniform C-Hypergraphs *
,-0001,():
The upper chromatic number x (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. This paper discusses the relationship between the lower bound of the size of C-edges and the lower bound of the upper chromatic number and gives an upper bound of minimum C-edge number of 4-uniform C-hypergraphs with minimum upper chromatic number.
【免责声明】以下全部内容由[刘桂真]上传于[2005年07月21日 23时19分13秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果