科研之友
微信
新浪微博
Facebook
分享链接
摘要
We show that for sufficiently large n, every 3-uniform hypergraph on n vertices with minimum vertex degree at least ((n-1)(2)) - ((right perpendicular3/4 n left perpendicular) (2)) + c, where c = 2 if n is an element of 4N and c = 1 if n is an element of 2N \ 4N, contains a loose Hamilton cycle. This degree condition is best possible and improves on the work of BO, Han and Schacht who proved the corresponding asymptotical result.
- 出版日期2015-9
