{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:09Z","timestamp":1740107109134,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:00:00Z","timestamp":1649203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:00:00Z","timestamp":1649203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871391"],"award-info":[{"award-number":["11871391"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1954134"],"award-info":[{"award-number":["DMS-1954134"]}],"id":[{"id":"10.13039\/100000001","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":[[2022,6]]},"DOI":"10.1007\/s00373-022-02475-1","type":"journal-article","created":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T12:03:07Z","timestamp":1649246587000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4447-2416","authenticated-orcid":false,"given":"Hongliang","family":"Lu","sequence":"first","affiliation":[]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,6]]},"reference":[{"key":"2475_CR1","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1016\/j.jcta.2012.02.004","volume":"119","author":"N Alon","year":"2012","unstructured":"Alon, N., Frankl, P., Huang, H., R\u00f6dl, V., Ruci\u0144ski, A., Sudakov, B.: Large matchings in uniform hypergraphs and the conjectures of Erd\u0151s and Samuels. J. Combin. Theory Ser. A 119, 1200\u20131215 (2012)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2475_CR2","first-page":"93","volume":"8","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P.: A problem on independent $$r$$-tuples. Ann. Univ. Sci.Budapest, E\u00f6tv\u00f6s Sect. Math. 8, 93\u201395 (1965)","journal-title":"Ann. Univ. Sci.Budapest, E\u00f6tv\u00f6s Sect. Math."},{"key":"2475_CR3","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1137\/16M1056079","volume":"30","author":"J Han","year":"2016","unstructured":"Han, J.: Perfect matchings in hypergraphs and the Erd\u0151s matching conjecture. SIAM J. Discrete Math. 30, 1351\u20131357 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"2475_CR4","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1016\/j.jcta.2013.01.008","volume":"120","author":"P Frankl","year":"2013","unstructured":"Frankl, P.: Improved bounds for Erd\u0151s matching conjecture. J. Combin. Theory Ser. A 120, 1068\u20131072 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"unstructured":"Frankl, P., Kupavskii, A.: The Erd\u0151s matching conjecture and concentration inequalities, arXiv:1806.08855","key":"2475_CR5"},{"key":"2475_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ejc.2013.11.006","volume":"38","author":"D K\u00fchn","year":"2014","unstructured":"K\u00fchn, D., Osthus, D., Townsend, T.: Fractional and integer matchings in uniform hypergraphs. European J. Combin. 38, 83\u201396 (2014)","journal-title":"European J. Combin."},{"key":"2475_CR7","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1016\/j.ejc.2006.05.008","volume":"27","author":"V R\u00f6dl","year":"2006","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Perfect matchings in uniform hypergraphs with large minimum degree. European J. Combin. 27, 1333\u20131349 (2006)","journal-title":"European J. Combin."},{"key":"2475_CR8","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/j.jcta.2008.10.002","volume":"116","author":"V R\u00f6dl","year":"2009","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Comb. Theory Ser. A 116, 613\u2013636 (2009)","journal-title":"J. Comb. Theory Ser. A"},{"key":"2475_CR9","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1016\/j.jcta.2012.04.006","volume":"119","author":"A Treglown","year":"2012","unstructured":"Treglown, A., Zhao, Y.: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs I. J. Comb. Theory Ser. A 119, 1500\u20131522 (2012)","journal-title":"J. Comb. Theory Ser. A"},{"key":"2475_CR10","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1016\/j.jcta.2013.04.008","volume":"120","author":"A Treglown","year":"2013","unstructured":"Treglown, A., Zhao, Y.: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II. J. Comb. Theory Ser. A 120, 1463\u20131482 (2013)","journal-title":"J. Comb. Theory Ser. A"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02475-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02475-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02475-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:44:51Z","timestamp":1654814691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02475-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2475"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02475-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,4,6]]},"assertion":[{"value":"29 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"80"}}