Author:
Hàn Hiệp,Han Jie,Zhao Yi
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference29 articles.
1. P. Allen, J. Böttcher, H. Hàn, Y. Kohayakawa, Y. Person, Blow-up lemmas for sparse graphs. ArXiv e-prints, 2016.
2. Loose Hamiltonian cycles forced by large (k−2)-degree - approximation version;Bastos;SIAM J. Discrete Math.,2017
3. Loose Hamiltonian cycles forced by large (k−2)-degree - sharp version;Bastos;Contrib. Discrete Math.,2019
4. Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs;Buß;J. Comb. Theory, Ser. B,2013
5. Tight codegree condition for the existence of loose Hamilton cycles in 3-graphs;Czygrinow;SIAM J. Discrete Math.,2014
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献