{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T22:59:51Z","timestamp":1762124391133,"version":"build-2065373602"},"reference-count":30,"publisher":"Elsevier BV","issue":"6","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.elsevier.com\/tdm\/userlicense\/1.0\/"},{"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.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2023RC49"],"award-info":[{"award-number":["2023RC49"]}],"id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771247","12071002","11971158","11901048"],"award-info":[{"award-number":["11771247","12071002","11971158","11901048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1016\/j.disc.2024.113959","type":"journal-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T06:58:06Z","timestamp":1710745086000},"page":"113959","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Vertex degree sums for matchings in 3-uniform hypergraphs"],"prefix":"10.1016","volume":"347","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1121-5643","authenticated-orcid":false,"given":"Yi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2024.113959_br0010","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1017\/S0963548316000353","article-title":"A rainbow r-partite version of the Erd\u0151s-Ko-Rado theorem","volume":"26","author":"Aharoni","year":"2017","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2024.113959_br0020","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1016\/j.jcta.2012.02.004","article-title":"Large matchings in uniform hypergraphs and the conjectures of Erd\u0151s and Samuels","volume":"119","author":"Alon","year":"2012","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.disc.2024.113959_br0030","first-page":"93","article-title":"A problem on independent r-tuples","volume":"8","author":"Erd\u0151s","year":"1965","journal-title":"Ann. Univ. Sci. Bp. E\u0151tv\u0151s Sect. Math."},{"issue":"8","key":"10.1016\/j.disc.2024.113959_br0040","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1006\/eujc.1996.0063","article-title":"An Erd\u0151-Ko-Rado theorem for direct products","volume":"17","author":"Frankl","year":"1996","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2024.113959_br0050","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/j.dam.2016.08.003","article-title":"On the maximum number of edges in a hypergraph with given matching number","volume":"216","author":"Frankl","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2024.113959_br0060","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1137\/080729657","article-title":"On perfect matchings in uniform hypergraphs with large minimum vertex degree","volume":"23","author":"H\u00e0n","year":"2009","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2024.113959_br0070","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1137\/16M1056079","article-title":"Perfect matchings in hypergraphs and the Erd\u0151s matching conjecture","volume":"30","author":"Han","year":"2016","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2024.113959_br0080","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1137\/10080796X","article-title":"Perfect matching in 3-uniform hypergraphs with large vertex degree","volume":"27","author":"Khan","year":"2013","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2024.113959_br0090","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.jctb.2015.09.005","article-title":"Perfect matchings in 4-uniform hypergraphs","volume":"116","author":"Khan","year":"2016","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2024.113959_br0100","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.20139","article-title":"Matchings in hypergraphs of large minimum degree","volume":"51","author":"K\u00fchn","year":"2006","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2024.113959_br0110","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jctb.2012.11.005","article-title":"Matchings in 3-uniform hypergraphs","volume":"103","author":"K\u00fchn","year":"2013","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2024.113959_br0120","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.jcta.2014.01.003","article-title":"On Erd\u0151s' extremal problem on matchings in hypergraphs","volume":"124","author":"\u0141uczak","year":"2014","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.disc.2024.113959_br0130","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.ejc.2011.02.001","article-title":"Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees","volume":"32","author":"Markstr\u00f6m","year":"2011","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2024.113959_br0140","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","article-title":"Note on Hamilton circuits","volume":"67","author":"Ore","year":"1960","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.disc.2024.113959_br0150","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s00373-008-0787-7","article-title":"Perfect matchings and K43-tilings in hypergraphs of large codegree","volume":"24","author":"Pikhurko","year":"2008","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2024.113959_br0160","series-title":"An Irregular Mind","first-page":"561","article-title":"Dirac-type questions for hypergraphs \u2013 a survey (or more problems for Endre to solve)","volume":"vol. 21","author":"R\u00f6dl","year":"2010"},{"key":"10.1016\/j.disc.2024.113959_br0170","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1016\/j.ejc.2006.05.008","article-title":"Perfect matchings in uniform hypergraphs with large minimum degree","volume":"27","author":"R\u00f6dl","year":"2006","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2024.113959_br0180","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00493-008-2295-z","article-title":"An approximate Dirac-type theorem for k-uniform hypergraphs","volume":"28","author":"R\u00f6dl","year":"2008","journal-title":"Combinatorica"},{"key":"10.1016\/j.disc.2024.113959_br0190","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/j.jcta.2008.10.002","article-title":"Perfect matchings in large uniform hypergraphs with large minimum collective degree","volume":"116","author":"R\u00f6dl","year":"2009","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.disc.2024.113959_br0200","doi-asserted-by":"crossref","first-page":"1528","DOI":"10.1016\/j.disc.2017.02.018","article-title":"An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs","volume":"340","author":"Tang","year":"2017","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2024.113959_br0210","doi-asserted-by":"crossref","first-page":"1500","DOI":"10.1016\/j.jcta.2012.04.006","article-title":"Exact minimum degree thresholds for perfect matchings in uniform hypergraphs","volume":"119","author":"Treglown","year":"2012","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.disc.2024.113959_br0220","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1016\/j.jcta.2013.04.008","article-title":"Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II","volume":"120","author":"Treglown","year":"2013","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.disc.2024.113959_br0230","article-title":"A note on perfect matchings in uniform hypergraphs","volume":"23","author":"Treglown","year":"2016","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2024.113959_br0240","doi-asserted-by":"crossref","first-page":"1795","DOI":"10.1007\/s10114-018-7260-1","article-title":"Some Ore-type results for matching and perfect matching in k-uniform hypergraphs","volume":"34","author":"Zhang","year":"2018","journal-title":"Acta Math. Sin. Engl. Ser."},{"key":"10.1016\/j.disc.2024.113959_br0250","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1016\/j.disc.2017.11.014","article-title":"d-matching in 3-uniform hypergraphs","volume":"341","author":"Zhang","year":"2018","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2024.113959_br0260","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1016\/j.disc.2019.01.028","article-title":"Matching in 3-uniform hypergraphs","volume":"342","author":"Zhang","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2024.113959_br0270","article-title":"Perfect matching and Hamilton cycle decomposition of complete balanced k+1-partite k-uniform hypergraphs","volume":"386","author":"Zhang","year":"2020","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.disc.2024.113959_br0280","article-title":"Vertex degree sums for perfect matchings in 3-uniform hypergraphs","volume":"25","author":"Zhang","year":"2018","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2024.113959_br0290","doi-asserted-by":"crossref","first-page":"P4.5","DOI":"10.37236\/8627","article-title":"Vertex degree sums for matchings in 3-uniform hypergraphs","volume":"26","author":"Zhang","year":"2019","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.disc.2024.113959_br0300","series-title":"Recent Trends in Combinatorics","article-title":"Recent advances on Dirac-type problems for hypergraphs","volume":"vol. 159","author":"Zhao","year":"2016"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X24000906?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X24000906?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T22:55:31Z","timestamp":1762124131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X24000906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["S0012365X24000906"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2024.113959","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Vertex degree sums for matchings in 3-uniform hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2024.113959","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"113959"}}