| 关于匹配数为1的极大2-均衡3-部3-图的结构 |
| |
| 引用本文： | 简纯,李国全.关于匹配数为1的极大2-均衡3-部3-图的结构[J].天津师范大学学报(自然科学版),2014(1):23-25. |
| |
| 作者姓名： | 简纯 李国全 |
| |
| 作者单位： | [1]天津师范大学数学科学学院,天津300387 [2]陕西师范大学数学与信息科学学院,西安710062 |
| |
| 摘 要： | 描述具有给定匹配数的极大k-一致超图的结构是一个尚未解决的问题.本研究充分利用完全2-均衡3-部3-图中所有互不相交的完美匹配,得到极图的边数,进而确定所有极图的结构.
|
| 关 键 词： | k-部k-图 m-均衡 完美匹配 |
Construction of 2-balanced 3-partite 3-uniform hypergraphs with 1-matching which had maximum number of edges |
| |
| JIAN Chun,LI Guoquan.Construction of 2-balanced 3-partite 3-uniform hypergraphs with 1-matching which had maximum number of edges[J].Journal of Tianjin Normal University(Natural Science Edition),2014(1):23-25. |
| |
| Authors: | JIAN Chun LI Guoquan |
| |
| Institution: | 1. College of Mathematical Science, Tianjin Normal University, Tianjin 300387, China; 2. College of Mathematics and Information Science, Shaanxi Normal University, Xi＇an 710062, China) |
| |
| Abstract: | Describing the construction of k-partite k-uniform hypergraphs with given matching number which had maximum number of edges is an unsolved problem. This article makes the most of mutually disjoint perfect matching in 2-balanced 3-partite 3-uniform hypergraphs and obtains the number of edges of the extreme graph, and then confirms the construction of all the extreme graphs. |
| |
| Keywords: | k-partite k-uniform hypergraph m-balanced perfect matching |
| 本文献已被 CNKI 维普 等数据库收录！ |
