Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version
暂无分享,去创建一个
Guilherme Oliveira Mota | Mathias Schacht | Josefran de Oliveira Bastos | Jakob Schnitzer | Fabian Schulenburg
[1] Daniela Kühn,et al. Hamilton l-cycles in uniform hypergraphs , 2009, J. Comb. Theory, Ser. A.
[2] Hiêp Hàn,et al. Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs , 2011, Electron. Notes Discret. Math..
[3] Hiêp Hàn,et al. Dirac-type results for loose Hamilton cycles in uniform hypergraphs , 2010, J. Comb. Theory, Ser. B.
[4] Daniela Kühn,et al. Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree , 2006, J. Comb. Theory, Ser. B.
[5] Vojtech Rödl,et al. The Uniformity Lemma for hypergraphs , 1992, Graphs Comb..
[6] Daniela Kühn,et al. Loose Hamilton cycles in hypergraphs , 2008, Discret. Math..
[7] Gyula Y. Katona,et al. Generating quadrangulations of surfaces with minimum degree at least 3 , 1999 .
[8] Vojtech Rödl,et al. A Dirac-Type Theorem for 3-Uniform Hypergraphs , 2006, Combinatorics, Probability and Computing.
[9] Fan Chung. Regularity lemmas for hypergraphs and quasi-randomness , 1991 .
[10] Yi Zhao,et al. Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs , 2014, J. Comb. Theory, Ser. A.
[11] Vojtech Rödl,et al. An approximate Dirac-type theorem for k-uniform hypergraphs , 2008, Comb..