Dirac-type results for loose Hamilton cycles in uniform hypergraphs
暂无分享,去创建一个
[1] E. Szemerédi,et al. A note on perfect matchings in uniform hypergraphs with large minimum collective degree , 2008 .
[2] Fan Chung Graham,et al. Regularity Lemmas for Hypergraphs and Quasi-randomness , 1991, Random Struct. Algorithms.
[3] Vojtech Rödl,et al. A Dirac-Type Theorem for 3-Uniform Hypergraphs , 2006, Combinatorics, Probability and Computing.
[4] Gyula Y. Katona,et al. Hamiltonian chains in hypergraphs , 2006, J. Graph Theory.
[5] Vojtech Rödl,et al. Perfect matchings in large uniform hypergraphs with large minimum collective degree , 2009, J. Comb. Theory, Ser. A.
[6] Vojtech Rödl,et al. An approximate Dirac-type theorem for k-uniform hypergraphs , 2008, Comb..
[7] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..
[8] Fan Chung. Regularity lemmas for hypergraphs and quasi-randomness , 1991 .
[9] Daniela Kühn,et al. Matchings in hypergraphs of large minimum degree , 2006 .
[10] Vojtech Rödl,et al. The Uniformity Lemma for hypergraphs , 1992, Graphs Comb..
[11] Daniela Kühn,et al. Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree , 2006, J. Comb. Theory, Ser. B.
[12] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .
[13] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[14] Daniela Kühn,et al. Loose Hamilton cycles in hypergraphs , 2008, Discret. Math..
[15] W. T. Gowers,et al. RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) , 2001 .
[16] Peter Keevash,et al. A hypergraph blow‐up lemma , 2010, Random Struct. Algorithms.
[17] Vojtech Rödl,et al. Perfect matchings in uniform hypergraphs with large minimum degree , 2006, Eur. J. Comb..