{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:42:56Z","timestamp":1794336176231,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540287025","type":"print"},{"value":"9783540318675","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_5","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:05:47Z","timestamp":1127815547000},"page":"52-56","source":"Crossref","is-referenced-by-count":0,"title":["The Generalization of Dirac\u2019s Theorem for Hypergraphs"],"prefix":"10.1007","author":[{"given":"Endre","family":"Szemer\u00e9di","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"39","volume":"260","author":"J.C. Bermond","year":"1976","unstructured":"Bermond, J.C., et al.: Hypergraphes hamiltoniens. Prob. Comb. Theorie Graph Orsay\u00a0260, 39\u201343 (1976)","journal-title":"Prob. Comb. Theorie Graph Orsay"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0378-3758(98)00029-9","volume":"72","author":"J. Demetrovics","year":"1998","unstructured":"Demetrovics, J., Katona, G.O.H., Sali, A.: Design type problems motivated by database theory. Journal of Statistical Planning and Inference\u00a072, 149\u2013164 (1998)","journal-title":"Journal of Statistical Planning and Inference"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G.A. Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems for abstract graphs. Proc. London Math. Soc.\u00a02(3), 69\u201381 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"5_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\u00a020(2), 131\u2013164 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"5_CR5","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":"G.Y. Katona","year":"1999","unstructured":"Katona, G.Y., Kierstead, H.A.: Hamiltonian chains in hypergraphs. J. Graph Theory\u00a030, 205\u2013212 (1999)","journal-title":"J. Graph Theory"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(199811)29:3<167::AID-JGT4>3.0.CO;2-O","volume":"29","author":"J. Koml\u00f3s","year":"1998","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: On the P\u00f3sa-Seymour conjecture. J. Graph Theory\u00a029, 167\u2013176 (1998)","journal-title":"J. Graph Theory"},{"key":"5_CR7","unstructured":"Kuhn, D., Osthus, D.: Matchings in hypergraphs of large minimum degree (submited)"},{"key":"5_CR8","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. North-Holland Mathematics Studies 121, Annals of Discrete Mathematics 29, North-Holland Publishing Co., Amsterdam; Akad\u00e9miai Kiad\u00f3, Budapest (1986)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: A Dirac-type theorem for 3-uniform hypergraphs, Combinatorics, Probability and Computing (to appear)","DOI":"10.1017\/S0963548305007042"},{"key":"5_CR10","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Perfect matchings in uniform hypergraphs with large minimum degree (submitted)"},{"key":"5_CR11","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: An approximative Dirac-type theorem for k-uniform hypergraphs (submitted)"},{"key":"5_CR12","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. 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":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:58:30Z","timestamp":1619492310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11549345_5","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11549345","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}