| 4一致(ξ)-超图的最小边数的上界 |
| |
| 引用本文： | 刁科凤,刘桂真. 4一致(ξ)-超图的最小边数的上界[J]. 应用数学, 2004, 17(4) |
| |
| 作者姓名： | 刁科凤 刘桂真 |
| |
| 基金项目： | 国家自然科学基金，国家自然科学基金 |
| |
| 摘 要： | 主要讨论了4一致l-超图的最小边数与最小上色数的关系,给出了上色数为3的4一致l-超图的最小边数的一个上界.
|
| 关 键 词： | 混合超图 严格染色 上色数 点对图两相渗流驱动问题的 |
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. |
| |
| Keywords: | l- hypergraph Strict coloring Upper chromatic number Pair graph |
| 本文献已被 万方数据 等数据库收录！ |
