{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T01:52:49Z","timestamp":1775872369766,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Anhui Initiative in Quantum Information Technologies grant","award":["AHY150200"],"award-info":[{"award-number":["AHY150200"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00373-022-02524-9","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T04:02:47Z","timestamp":1658203367000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hamiltonian Paths and Cycles in Some 4-Uniform Hypergraphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Guanwu","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6398-9683","authenticated-orcid":false,"given":"Xiaonan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"2524_CR1","first-page":"39","volume":"260","author":"JC Bermond","year":"1976","unstructured":"Bermond, J.C., Germa, A., Heydemann, M.C.: Hypergraphes hamiltoniens. Prob. Comb. Theorie Graph Orsay 260, 39\u201343 (1976)","journal-title":"Prob. Comb. Theorie Graph Orsay"},{"key":"2524_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/120890417","volume":"28","author":"A Czygrinow","year":"2014","unstructured":"Czygrinow, A., Molla, T.: Tight codegree condition for the existence of loose Hamilton cycles in 3-graphs. SIAM J. Discrete Math. 28, 67\u201376 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"2524_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"3","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems of abstract graphs. Proc. Lond. Math. Soc. 3, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2524_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/rsa.10017","volume":"20","author":"P Frankl","year":"2002","unstructured":"Frankl, P., R\u00f6dl, V.: Extremal problems on set systems. Random Struct. Algorithms 20, 131\u2013164 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"2524_CR5","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.jctb.2007.07.002","volume":"98","author":"A Gy\u00e1rf\u00e1s","year":"2008","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J., S\u00e1rk\u00f6zy, G., Schelp, R.: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Combin. Theory Ser. B 98, 342\u2013358 (2008)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2524_CR6","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jctb.2015.03.007","volume":"114","author":"J Han","year":"2015","unstructured":"Han, J., Zhao, Y.: Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs. J. Combin. Theory Ser. B 114, 70\u201396 (2015)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2524_CR7","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.jctb.2009.10.002","volume":"100","author":"H H\u00e0n","year":"2010","unstructured":"H\u00e0n, H., Schacht, M.: Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Combin. Theory Ser. B 100, 332\u2013346 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2524_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jcta.2005.02.005","volume":"113","author":"P Haxell","year":"2006","unstructured":"Haxell, P., Luczak, T., Peng, Y., R\u00f6dl, V., Ruc\u00ednski, A., Simonovits, M., Skokan, J.: The Ramsey number for hypergraph cycles I. J. Combin. Theory Ser. A 113, 67\u201383 (2006)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2524_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., Luczak, T., Ruc\u00ednski, A.: Random Graphs. Wiley, New York (2000)"},{"key":"2524_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O","volume":"30","author":"GyY Katona","year":"1999","unstructured":"Katona, Gy.Y., Kierstead, H.A.: Hamiltonian chains in hypergraphs. J. Graph Theory 30, 205\u2013212 (1999)","journal-title":"J. Graph Theory"},{"key":"2524_CR11","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.jctb.2006.02.004","volume":"96","author":"D K\u00fchn","year":"2006","unstructured":"K\u00fchn, D., Osthus, D.: Loose Hamilton cycles in 3-uniform hypergraphs of large minimum degree. J. Combin. Theory Ser. B 96, 767\u2013821 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2524_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1112\/plms.12235","volume":"119","author":"C Reiher","year":"2019","unstructured":"Reiher, C., R\u00f6dl, V., Ruci\u0144ski, A., Schacht, M., Szemer\u00e9di, E.: Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs. Proc. Lond. Math. Soc. (3) 119, 409\u2013439 (2019)","journal-title":"Proc. Lond. Math. Soc. (3)"},{"key":"2524_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1017\/S0963548305007042","volume":"15","author":"V R\u00f6dl","year":"2006","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: A Dirac-type theorem for 3-uniform hypergraphs. Combin. Probab. Comput. 15, 229\u2013251 (2006)","journal-title":"Combin. Probab. Comput."},{"key":"2524_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00493-008-2295-z","volume":"28","author":"V R\u00f6dl","year":"2008","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: An approximate Dirac-type theorem for k-uniform hypergraphs. Combinatorica 28, 229\u2013260 (2008)","journal-title":"Combinatorica"},{"key":"2524_CR15","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1016\/j.aim.2011.03.007","volume":"227","author":"V R\u00f6dl","year":"2011","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs. Adv. Math. 227, 1225\u20131299 (2011)","journal-title":"Adv. Math."},{"key":"2524_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00026-017-0345-1","volume":"21","author":"V R\u00f6dl","year":"2017","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Schacht, M., Szemer \u0161\u0160di, E.: On the Hamiltonicity of triple systems with high minimum degree. Ann. Combin. 21, 95\u2013117 (2017)","journal-title":"Ann. Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02524-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02524-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02524-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T13:17:29Z","timestamp":1660223849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02524-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["2524"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02524-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"1 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"122"}}