{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:42:44Z","timestamp":1773276164114,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["12071453"],"award-info":[{"award-number":["12071453"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00373-024-02802-8","type":"journal-article","created":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T17:01:37Z","timestamp":1717261297000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Dirac-Type Theorem for Uniform Hypergraphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Yue","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7634-0250","authenticated-orcid":false,"given":"Xinmin","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,1]]},"reference":[{"issue":"19","key":"2802_CR1","doi-asserted-by":"publisher","first-page":"4487","DOI":"10.1016\/j.disc.2007.08.047","volume":"308","author":"PN Balister","year":"2008","unstructured":"Balister, P.N., Gy\u0151ri, E., Lehel, J., Schelp, R.H.: Connected graphs without long paths. Discrete Math. 308(19), 4487\u20134494 (2008)","journal-title":"Discrete Math."},{"key":"2802_CR2","unstructured":"Bermond, J.-C., Germa, A., Heydemann, M.-C., Sotteau, D.: Hypergraphes Hamiltoniens. In: Probl\u00e9mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976). Colloq. Internat. CNRS, vol. 260, pp. 39\u201343. CNRS, Paris (1978)"},{"key":"2802_CR3","first-page":"181","volume":"54","author":"D Clemens","year":"2016","unstructured":"Clemens, D., Ehrenm\u00fcller, J., Person, Y.: A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs, Electron. Notes. Discrete Math. 54, 181\u2013186 (2016)","journal-title":"Discrete Math."},{"issue":"3","key":"2802_CR4","doi-asserted-by":"publisher","first-page":"3.39","DOI":"10.37236\/8611","volume":"27","author":"D Clemens","year":"2020","unstructured":"Clemens, D., Ehrenm\u00fcller, J., Person, Y.: A Dirac-type theorem for Berge cycles in random hypergraphs. Electron. J. Combin. 27(3), 3.39 (2020)","journal-title":"Electron. J. Combin."},{"issue":"3","key":"2802_CR5","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1137\/18M1218881","volume":"34","author":"M Coulson","year":"2020","unstructured":"Coulson, M., Perarnau, G.: A rainbow Dirac\u2019s theorem. SIAM J. Discrete Math. 34(3), 1670\u20131692 (2020)","journal-title":"SIAM J. Discrete Math."},{"key":"2802_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ejc.2017.10.006","volume":"69","author":"A Davoodi","year":"2018","unstructured":"Davoodi, A., Gy\u0151ri, E., Methuku, A., Tompkins, C.: An Erd\u0151s-Gallai type theorem for uniform hypergraphs. Eur. J. Combin. 69, 159\u2013162 (2018)","journal-title":"Eur. J. Combin."},{"key":"2802_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. (3) 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc. (3)"},{"key":"2802_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hung. 10, 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hung."},{"issue":"3","key":"2802_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1017\/S0963548319000415","volume":"29","author":"B Ergemlidze","year":"2020","unstructured":"Ergemlidze, B., Gy\u0151ri, E., Methuku, A., Salia, N., Tompkins, C., Zamora, O.: Avoiding long Berge cycles, the missing cases $$k=r+1$$ and $$k=r+2$$. Combin. Probab. Comput. 29(3), 423\u2013435 (2020). https:\/\/doi.org\/10.1017\/S0963548319000415","journal-title":"Combin. Probab. Comput."},{"key":"2802_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jctb.2018.12.001","volume":"137","author":"Z F\u00fcredi","year":"2019","unstructured":"F\u00fcredi, Z., Kostochka, A., Luo, R.: Avoiding long Berge cycles. J. Comb. Theory Ser. B 137, 55\u201364 (2019)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"2802_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.4310\/JOC.2021.v12.n2.a4J","volume":"12","author":"Z F\u00fcredi","year":"2021","unstructured":"F\u00fcredi, Z., Kostochka, A., Luo, R.: Avoiding long Berge cycles II, exact bounds for all $$n$$. J. Combin. 12(2), 247\u2013268 (2021). https:\/\/doi.org\/10.4310\/JOC.2021.v12.n2.a4J","journal-title":"J. Combin."},{"issue":"4","key":"2802_CR12","doi-asserted-by":"publisher","first-page":"4.31","DOI":"10.37236\/8488","volume":"26","author":"Z F\u00fcredi","year":"2019","unstructured":"F\u00fcredi, Z., Kostochka, A., Luo, R.: On 2-connected hypergraphs with no long cycles. Electron. J. Comb. 26(4), 4.31 (2019)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"2802_CR13","doi-asserted-by":"publisher","first-page":"3.9","DOI":"10.37236\/9346","volume":"27","author":"Z F\u00fcredi","year":"2020","unstructured":"F\u00fcredi, Z., Kostochka, A., Luo, R.: Berge cycles in non-uniform hypergraphs. Electron. J. Combin. 27(3), 3.9 (2020)","journal-title":"Electron. J. Combin."},{"key":"2802_CR14","doi-asserted-by":"crossref","unstructured":"Gerbner, D., Nagy, D.T., Patk\u00f3s, B., Salia, N., Vizer, M.: Stability of extremal connected hypergraphs avoiding Berge-paths, In: Ne\u0161et\u0159il, J., Perarnau, G., Ru\u00e9, J., Serra, O. (eds) Extended Abstracts EuroComb 2021. Trends in Mathematics, vol. 14, pp. 117\u2013122 (2021)","DOI":"10.1007\/978-3-030-83823-2_19"},{"key":"2802_CR15","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ejc.2016.05.012","volume":"58","author":"E Gy\u0151ri","year":"2016","unstructured":"Gy\u0151ri, E., Katona, G.Y., Lemons, N.: Hypergraph extensions of the Erd\u0151s-Gallai theorem. Eur. J. Combin. 58, 238\u2013246 (2016)","journal-title":"Eur. J. Combin."},{"issue":"9","key":"2802_CR16","doi-asserted-by":"publisher","first-page":"2602","DOI":"10.1016\/j.disc.2018.06.006","volume":"341","author":"E Gy\u0151ri","year":"2018","unstructured":"Gy\u0151ri, E., Methuku, A., Salia, N., Tompkins, C., Vizer, M.: On the maximum size of connected hypergraphs without a path of given length. Discrete Math. 341(9), 2602\u20132605 (2018)","journal-title":"Discrete Math."},{"key":"2802_CR17","doi-asserted-by":"publisher","first-page":"103353","DOI":"10.1016\/j.ejc.2021.103353","volume":"96","author":"E Gy\u0151ri","year":"2021","unstructured":"Gy\u0151ri, E., Salia, N., Zamora, O.: Connected Hypergraphs without long Berge paths. Eur. J. Combin. 96, 103353 (2021)","journal-title":"Eur. J. Combin."},{"key":"2802_CR18","doi-asserted-by":"crossref","unstructured":"Keevash, P.: Hypergraph Tur\u00e1n problems. In: Chapman, R. (ed.) Surveys in Combinatorics 2011. London Math. Soc. Lecture Note Ser., vol. 392, pp.83\u2013139. Cambridge Univ. Press, Cambridge (2011)","DOI":"10.1017\/CBO9781139004114.004"},{"issue":"1","key":"2802_CR19","first-page":"19","volume":"234","author":"GN Kopylov","year":"1977","unstructured":"Kopylov, G.N.: Maximal paths and cycles in a graph. Dokl. Akad. Nauk SSSR 234(1), 19\u201321 (1977)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"2802_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.jctb.2017.08.005","volume":"128","author":"R Luo","year":"2018","unstructured":"Luo, R.: The maximum number of cliques in graphs without long cycles. J. Combin. Theory Ser. B 128, 219\u2013226 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2802_CR21","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-14444-8_16","volume":"21","author":"V R\u00f6dl","year":"2010","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A.: Dirac-type questions for hypergraphs\u2013a survey (or more problems for Endre to solve). An Irregular Mind Bolyai Soc. Math. Stud. 21, 561\u2013590 (2010)","journal-title":"An Irregular Mind Bolyai Soc. Math. Stud."},{"key":"2802_CR22","doi-asserted-by":"crossref","unstructured":"Zhao, Y.: Recent advances on Dirac-type problems for hypergraphs. In: Beveridge, A., et al. (eds.), Recent Trends in Combinatorics, The IMA Volumes in Mathematics and its Applications 159, pp. 145\u2013165 (2016)","DOI":"10.1007\/978-3-319-24298-9_6"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02802-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02802-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02802-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T19:03:56Z","timestamp":1723230236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02802-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,1]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["2802"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02802-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,1]]},"assertion":[{"value":"23 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"76"}}