期刊文献+

匹配数为1的极值2-均衡4-部4-图的结构

Structure of 2-balanced 4-partite 4-uniform extremal hypergraphs with 1-matching
下载PDF
导出
摘要 设G为一个匹配数为1的极值2-均衡4-部4-图,通过引入度序列确定了所有极图的结构,证明了它们共有7个同构类,并详尽描述了各类极图的结构. Let G be a 2-balanced 4-partite 4-uniform extremal hypergraphs with matching number 1. By introducing the de- gree sequence, the structures of all the extremal hypergraphs are determined. It is proved that the extremal hypergraphs have 7 isomorphic objects, and the structures of every isomorphic object are described in detail.
作者 刘琦 李国全
出处 《天津师范大学学报(自然科学版)》 CAS 2015年第2期24-27,共4页 Journal of Tianjin Normal University:Natural Science Edition
关键词 k-部k-图 匹配数 度序列 k-partite k-uniform hypergraph matching number degree sequence
  • 相关文献

参考文献5

  • 1RODL V, RUCINSKI A, SZEMEREDI E. Perfect matching in large uniform hypergraphs with large minimum collective degree[J]. Journal of Combinatorial Theory, 2007, 10(2) : 1-3.
  • 2MARKSTROM K, RUCINSKI A. Perfect matchings and Hamiltonian cycles in hypergraphs with large degrees[J]. European Journal of Combi- natorics, 2011, 32(5): 677-687.
  • 3董晓光,李国全.具有固定匹配数的极值k-部k-一致超图的结构[J].天津师范大学学报(自然科学版),2013,33(3):4-8. 被引量:1
  • 4FRANKL P, RUCINSKI A. On the maximum number of edges in a triple system not containing a disjoint family of a given size[J]. Combi- natorics, Probability and Computing, 2012, 21(2): 141-148.
  • 5HUANG H, LOH P, SUDAKOV B. The size of a hypergraph and its matching number[J]. Combinatorics, Probability and Computing, 2012, 21(3): 442-450.

二级参考文献3

  • 1BERGE C. Nombres de coloration de l'hypergraphe h-parti comlet[J]. Annali di Matematica Pura ed Applicata, 1975, 103( 1 ) : 3-9.
  • 2DIESTEL R. Graph Theory[M]. New York : Springer-Verlag, 2005.
  • 3MARKSTROM K, RUCII:ISKI A. Perfect matchings and Hamihon cycles in hypergraphs with large degrees[J]. European Journal of Combinatorics, 2011, 32(5): 677--687.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部