乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T03:05:18Z","timestamp":1719889518824},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:00:00Z","timestamp":1723334400000},"content-version":"am","delay-in-days":284,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271425"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["12201400","2022YFA1006400"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1954134"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1016\/j.jctb.2023.07.003","type":"journal-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T14:48:54Z","timestamp":1691765334000},"page":"83-111","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Co-degree threshold for rainbow perfect matchings in uniform hypergraphs"],"prefix":"10.1016","volume":"163","author":[{"given":"Hongliang","family":"Lu","sequence":"first","affiliation":[]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2023.07.003_br0010","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/jgt.3190090117","article-title":"On the size of graphs with complete-factors","volume":"9","author":"Akiyama","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.jctb.2023.07.003_br0020","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1017\/S0963548316000353","article-title":"A rainbow k-partite version of the Erd\u0151s-Ko-Rado theorem","volume":"26","author":"Aharoni","year":"2017","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.jctb.2023.07.003_br0030","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","article-title":"The Probabilistic Method","author":"Alon","year":"2008"},{"key":"10.1016\/j.jctb.2023.07.003_br0040","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1093\/qmath\/27.1.25","article-title":"Sets of independent edges of a hypergraphs","volume":"27","author":"Bollob\u00e1s","year":"1976","journal-title":"Q. J. Math. Oxford Ser."},{"key":"10.1016\/j.jctb.2023.07.003_br0050","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Path, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Can. J. Math."},{"key":"10.1016\/j.jctb.2023.07.003_br0060","article-title":"Simple juntas for shifted families","author":"Frankl","year":"2020","journal-title":"Discrete Anal."},{"key":"10.1016\/j.jctb.2023.07.003_br0070","doi-asserted-by":"crossref","first-page":"2423","DOI":"10.1007\/s11425-020-1890-4","article-title":"On the rainbow matching conjecture for 3-uniform hypergraphs","volume":"65","author":"Gao","year":"2022","journal-title":"Sci. China Math."},{"key":"10.1016\/j.jctb.2023.07.003_br0080","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1017\/S0963548314000613","article-title":"Near perfect matching in k-uniform hypergraph","volume":"24","author":"Han","year":"2015","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.jctb.2023.07.003_br0090","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\u00e1n","year":"2009","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jctb.2023.07.003_br0100","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1017\/S096354831100068X","article-title":"The size of a hypergraph and its matching number","volume":"21","author":"Huang","year":"2012","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.jctb.2023.07.003_br0110","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.jcta.2017.03.006","article-title":"Degree versions of the Erd\u0151s-Ko-Rado theorem and Erd\u0151s hypergraph matching conjecture","volume":"150","author":"Huang","year":"2017","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jctb.2023.07.003_br0130","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1112\/blms.12343","article-title":"On a rainbow version of Dirac's theorem","volume":"52","author":"Joos","year":"2020","journal-title":"Bull. Lond. Math. Soc."},{"key":"10.1016\/j.jctb.2023.07.003_br0120","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.jctb.2023.07.003_br0140","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1137\/10080796X","article-title":"Perfect matchings in 3-uniform hypergraphs with large vertex degree","volume":"27","author":"Khan","year":"2013","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jctb.2023.07.003_br0150","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. A"},{"key":"10.1016\/j.jctb.2023.07.003_br0160","author":"Keevash"},{"key":"10.1016\/j.jctb.2023.07.003_br0170","author":"Keevash"},{"key":"10.1016\/j.jctb.2023.07.003_br0180","author":"Keller"},{"key":"10.1016\/j.jctb.2023.07.003_br0190","doi-asserted-by":"crossref","first-page":"360?","DOI":"10.1112\/blms.12423","article-title":"Rainbow matchings in k-partite hypergraphs","volume":"53","author":"Kiselev","year":"2021","journal-title":"Bull. Lond. Math. Soc."},{"key":"10.1016\/j.jctb.2023.07.003_br0200","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.jctb.2023.07.003_br0210","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.jctb.2023.07.003_br0220","author":"Kupavskii"},{"key":"10.1016\/j.jctb.2023.07.003_br0230","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/16M1097948","article-title":"Almost perfect matchings in k-partite k-graphs","volume":"32","author":"Lu","year":"2018","journal-title":"SIAM J. Discrete Math."},{"issue":"105700","key":"10.1016\/j.jctb.2023.07.003_br0240","article-title":"A better bound on the size of rainbow matchings","volume":"195","author":"Lu","year":"2023","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jctb.2023.07.003_br0250","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1137\/21M1442383","article-title":"Rainbow perfect matchings for 4-uniform hypergraphs","volume":"36","author":"Lu","year":"2022","journal-title":"SIAM J. Discrete Math."},{"issue":"105489","key":"10.1016\/j.jctb.2023.07.003_br0260","article-title":"Rainbow matchings for 3-uniform hypergraphs","volume":"183","author":"Lu","year":"2021","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jctb.2023.07.003_br0270","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.jctb.2023.07.003_br0280","doi-asserted-by":"crossref","first-page":"616","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.jctb.2023.07.003_br0290","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.jctb.2023.07.003_br0300","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"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895623000515?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895623000515?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T04:42:06Z","timestamp":1710996126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895623000515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":30,"alternative-id":["S0095895623000515"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2023.07.003","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2023,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Co-degree threshold for rainbow perfect matchings in uniform hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jctb.2023.07.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}