Vertex Degree Sums for Perfect Matchings in 3-Uniform Hypergraphs

Electronic Journal Of Combinatorics

Yi Zhang¹ 

关键词: Perfect matchings;    Hypergraphs;    Dirac';    s theorem;    Ore';    s condition;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-uniform hypergraph without an isolated vertex. Suppose that $H$ is a 3-uniform hypergraph whose order $n$ is sufficiently large and divisible by $3$. If $H

【 授权许可】

Others