Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version
Keywords:Hypergraphs, Hamiltonian cycles, Degree conditions
We prove for all k\geq 4 and 1\leq \ell <k/2 the sharp minimum (k-2)-degree bound for a k-uniform hypergraph H on n vertices to contain a Hamiltonian \ell-cycle if k-\ell divides n and n is sufficiently large. This extends a result of Han and Zhao for 3-uniform hypegraphs.
2. E. Buß, H. Hán, and M. Schacht, Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs, J. Combin. Theory Ser. B 103 (2013), no. 6, 658–678, DOI 10.1016/j.jctb.2013.07.004. MR3127586
3. P. Frankl and Z. Füredi, Forbidding just one intersection, J. Combin. Theory Ser. A 39 (1985), no. 2, 160–176, DOI 10.1016/0097-3165(85)90035-4. MR793269 Ò10
4. H. Hán and M. Schacht, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, J. Combin. Theory Ser. B 100 (2010), no. 3, 332–346, DOI 10.1016/j.jctb.2009.10.002. MR2595675
5. J. Han and Y. Zhao, Minimum codegree threshold for Hamilton l-cycles in k-uniform hypergraphs, J. Combin. Theory Ser. A 132 (2015), 194–223, DOI 10.1016/j.jcta.2015.01.004. MR3311344
6. J. Han and Y. Zhao, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, J. Combin. Theory Ser. B 114 (2015), 70–96, DOI 10.1016/j.jctb.2015.03.007.
7. G. Y. Katona and H. A. Kierstead, Hamiltonian chains in hypergraphs, J. Graph Theory 30 (1999), no. 3, 205–212, DOI 10.1002/(SICI)1097-0118(199903)30:3<205:: AID-JGT5
8. P. Keevash, D. Kühn, R. Mycroft, and D. Osthus, Loose Hamilton cycles in hypergraphs, Discrete Math. 311 (2011), no. 7, 544–559, DOI 10.1016/j.disc.2010.11.013. MR2765622
9. D. Kühn, R. Mycroft, and D. Osthus, Hamilton l-cycles in uniform hypergraphs, J. Combin. Theory Ser. A 117 (2010), no. 7, 910–927, DOI 10.1016/j.jcta.2010.02.010. MR2652102
10. D. Kühn and D. Osthus, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, J. Combin. Theory Ser. B 96 (2006), no. 6, 767–821, DOI 10.1016/j.jctb.2006.02.004. MR2274077
11. V. Rödl and A. Ruciński, Dirac-type questions for hypergraphs—a survey (or more problems for Endre to solve), An irregular mind, Bolyai Soc. Math. Stud., vol. 21, János Bolyai Math. Soc., Budapest, 2010, pp. 561–590, DOI 10.1007/978-3-642-14444-8 16. MR2815614
12. V. Rödl, A. Ruciński, and E. Szemerédi, A Dirac-type theorem for 3-uniform hypergraphs, Combin. Probab. Comput. 15 (2006), no. 1-2, 229–251, DOI 10.1017/S0963548305007042. MR2195584
13. V. Rödl, A. Ruciński, and E. Szemerédi, An approximate Dirac-type theorem for k-uniform hypergraphs, Combinatorica 28 (2008), no. 2, 229–260, DOI 10.1007/s00493-008-2295-z. MR2399020
14. Y. Zhao, Recent advances on Dirac-type problems for hypergraphs, Recent trends in combinatorics, IMA Vol. Math. Appl., vol. 159, Springer, 2016, pp. 145–165,
DOI 10.1007/978-3-319-24298-9 6. MR3526407
This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).
The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.
Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:
The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.
The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.
The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.
In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.
The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.
If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.
The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.
The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/
This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.