{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:43:00Z","timestamp":1773276180514,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T00:00:00Z","timestamp":1713139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T00:00:00Z","timestamp":1713139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00493-024-00096-1","type":"journal-article","created":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T08:01:56Z","timestamp":1713168116000},"page":"849-880","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Hypergraph Analog of Dirac\u2019s Theorem for Long Cycles in 2-Connected Graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Alexandr","family":"Kostochka","sequence":"first","affiliation":[]},{"given":"Ruth","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Grace","family":"McCourt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,15]]},"reference":[{"key":"96_CR1","unstructured":"Bermond, J.-C., Germa, A., Heydemann, M.-C., Sotteau, D.: Hypergraphes Hamiltoniens, in Probl\u00e8mes combinatoires et th\u00e8orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976). Colloq. Internat. CNRS, 260 (CNRS, Paris, 1978), 39\u201343"},{"key":"96_CR2","first-page":"181","volume":"54","author":"D Clemens","year":"2020","unstructured":"Clemens, D., Ehrenm\u00fcller, J., Person, Y.: A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs. Electron. J. Combin. 54, 181\u2013186 (2020)","journal-title":"Electron. J. Combin."},{"key":"96_CR3","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, 1670\u20131692 (2020)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"96_CR4","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 on abstract graphs. Proc. London Math. Soc. 3(2), 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"96_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/jgt.3190080209","volume":"8","author":"H Enomoto","year":"1984","unstructured":"Enomoto, H.: Long paths and large cycles in finite graphs. J. Graph Theory 8, 287\u2013301 (1984)","journal-title":"J. Graph Theory"},{"key":"96_CR6","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, 423\u2013435 (2020)","journal-title":"Combin. Probab. Comput."},{"key":"96_CR7","doi-asserted-by":"crossref","unstructured":"Fan, G.: Long cycles and the codiameter of a graph. II, Cycles and rays (Montreal, PQ, 1987), 87\u201394, NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci., 301, Kluwer Acad. Publ., Dordrecht (1990)","DOI":"10.1007\/978-94-009-0517-7_8"},{"key":"96_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0095-8956(90)90024-T","volume":"49","author":"G Fan","year":"1990","unstructured":"Fan, G.: Long cycles and the codiameter of a graph. I. J. Combin. Theory Ser. B 49, 151\u2013180 (1990)","journal-title":"I. J. Combin. Theory Ser. B"},{"key":"96_CR9","doi-asserted-by":"crossref","unstructured":"F\u00fcredi, Z., Kostochka, A., Luo, R.: Avoiding long Berge cycles. J. Combinatorial Theory, Ser. B 137, 55\u201364 (2019)","DOI":"10.1016\/j.jctb.2018.12.001"},{"issue":"4","key":"96_CR10","first-page":"26","volume":"27","author":"Z F\u00fcredi","year":"2019","unstructured":"F\u00fcredi, Z., Kostochka, A., Luo, R.: On $$2$$-connected hypergraphs with no long cycles. Electronic J. Combin. 27(4), 26 (2019)","journal-title":"Electronic J. Combin."},{"key":"96_CR11","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. European J. Combin. 58, 238\u2013246 (2016)","journal-title":"European J. Combin."},{"key":"96_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.jctb.2020.04.007","volume":"148","author":"E Gy\u0151ri","year":"2021","unstructured":"Gy\u0151ri, E., Lemons, N., Salia, N., Zamora, O.: The structure of hypergraphs without long Berge cycles. J. Combin. Theory Ser. B 148, 239\u2013250 (2021)","journal-title":"J. Combin. Theory Ser. B"},{"key":"96_CR13","doi-asserted-by":"publisher","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. European J. Combin. 96, 103353 (2021)","journal-title":"European J. Combin."},{"key":"96_CR14","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0095-8956(85)90077-2","volume":"38","author":"B Jackson","year":"1985","unstructured":"Jackson, B.: Long cycles in bipartite graphs. J. Combin. Theory Ser. B 38, 118\u2013131 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"96_CR15","unstructured":"Kostochka, A., Luo, R., McCourt, G.: Dirac\u2019s Theorem for hamiltonian Berge cycles in uniform hypergraphs, submitted, arXiv:2109.12637, 23 pp. (2022)"},{"key":"96_CR16","doi-asserted-by":"crossref","unstructured":"Kostochka, A., Luo, R., McCourt, G.: Minimum degree ensuring that a hypergraph is hamiltonian-connected, submitted, arXiv:2207.14794, 22 pp. (2022)","DOI":"10.1016\/j.ejc.2023.103782"},{"key":"96_CR17","unstructured":"Kostochka, A., Luo, R., McCourt, G.: On a property of $$2$$-connected graphs and Dirac\u2019s Theorem, submitted, arXiv:2212.06897, p. 4 (2022)"},{"key":"96_CR18","unstructured":"Ma, Y., Hou, X., Gao, J.: A Dirac-type theorem for uniform hypergraphs, arXiv:2004.05073, p. 17 (2020)"},{"key":"96_CR19","unstructured":"Salia, N.: P\u00f3sa-type results for Berge hypergraphs, arXiv:2111.06710v2, p. 15 (2021)"},{"issue":"4","key":"96_CR20","first-page":"57","volume":"23","author":"HJ Voss","year":"1977","unstructured":"Voss, H.J., Zuluaga, C.: Maximale gerade und ungerade Kreise in Graphen I, Wiss 2. Tech. Hochsch. Ilmenau 23(4), 57\u201370 (1977)","journal-title":"Tech. Hochsch. Ilmenau"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00096-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00096-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00096-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T17:05:11Z","timestamp":1721840711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00096-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,15]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["96"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00096-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,15]]},"assertion":[{"value":"29 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}