{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T21:12:53Z","timestamp":1774645973237,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00493-008-2295-z","type":"journal-article","created":{"date-parts":[[2008,4,26]],"date-time":"2008-04-26T07:55:19Z","timestamp":1209196519000},"page":"229-260","source":"Crossref","is-referenced-by-count":105,"title":["An approximate Dirac-type theorem for k-uniform hypergraphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"first","affiliation":[]},{"given":"Endre","family":"Szemer\u00e9di","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,27]]},"reference":[{"key":"2295_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"N. Alon and J. Spencer: The Probabilistic Method, Second Edition, John Wiley and Sons, New York (2000).","edition":"Second Edition"},{"key":"2295_CR2","first-page":"39","volume":"260","author":"J. C. Bermond","year":"1976","unstructured":"J. C. Bermond, et al.: Hypergraphes hamiltoniens, Prob. Comb. Theorie Graph Orsay 260 (1976), 39\u201343.","journal-title":"Prob. Comb. Theorie Graph Orsay"},{"key":"2295_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"3","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac: Some theorems of abstract graphs, Proc. London Math. Soc. 3 (1952), 69\u201381.","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"2295_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/rsa.10017","volume":"20","author":"P. Frankl","year":"2002","unstructured":"P. Frankl and V. R\u00f6dl: Extremal problems on set systems, Random Struct. Algorithms 20(2) (2002), 131\u2013164.","journal-title":"Random Struct. Algorithms"},{"key":"2295_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jcta.2005.02.005","volume":"113","author":"P. Haxell","year":"2006","unstructured":"P. Haxell, T. \u0141uczak, Y. Peng, V. R\u00f6dl, A. Ruci\u0144ski, M. Simonovits and J. Skokan: The Ramsey number for hypergraph cycles I, J. Combin. Theory Series A 113 (2006), 67\u201383.","journal-title":"J. Combin. Theory Series A"},{"key":"2295_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"S. Janson, T. \u0141uczak and A. Ruci\u0144ski: Random Graphs, John Wiley and Sons, New York (2000)."},{"issue":"3","key":"2295_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O","volume":"30","author":"Gy. Y. Katona","year":"1999","unstructured":"Gy. Y. Katona and H. A. Kierstead: Hamiltonian chains in hypergraphs, J. Graph Theory 30(3) (1999), 205\u2013212.","journal-title":"J. Graph Theory"},{"key":"2295_CR8","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.jctb.2006.02.004","volume":"96","author":"D. K\u00fchn","year":"2006","unstructured":"D. K\u00fchn and D. Osthus: Loose Hamilton cycles in 3-uniform hypergraphs of large minimum degree, J. Combin. Theory Series B 96 (2006), 767\u2013821.","journal-title":"J. Combin. Theory Series B"},{"issue":"1\u20132","key":"2295_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0963548305007042","volume":"15","author":"V. R\u00f6dl","year":"2006","unstructured":"V. R\u00f6dl, A. Ruci\u0144ski and E. Szemer\u00e9di: A Dirac-type theorem for 3-uniform hypergraphs, Combinatorics, Probability and Computing 15(1\u20132) (2006), 229\u2013251.","journal-title":"Combinatorics, Probability and Computing"},{"key":"2295_CR10","series-title":"Colloq. Internat. CNRS","first-page":"399","volume-title":"Problemes combinatoires et theorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976)","author":"E. Szemer\u00e9di","year":"1978","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, in: Problemes combinatoires et theorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 399\u2013401, Colloq. Internat. CNRS, 260, CNRS, Paris (1978)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2295-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-008-2295-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2295-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:45Z","timestamp":1559079165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-008-2295-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["2295"],"URL":"https:\/\/doi.org\/10.1007\/s00493-008-2295-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}