乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T18:35:34Z","timestamp":1720722934154},"reference-count":22,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1016\/j.jcta.2013.04.008","type":"journal-article","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T12:07:04Z","timestamp":1367928424000},"page":"1463-1482","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":37,"title":["Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II"],"prefix":"10.1016","volume":"120","author":[{"given":"Andrew","family":"Treglown","sequence":"first","affiliation":[]},{"given":"Yi","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcta.2013.04.008_br0010","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. Combin. Theory Ser. A"},{"issue":"2","key":"10.1016\/j.jcta.2013.04.008_br0020","doi-asserted-by":"crossref","DOI":"10.37236\/2338","article-title":"Tight co-degree condition for perfect matchings in 4-graphs","volume":"19","author":"Czygrinow","year":"2012","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.jcta.2013.04.008_br0030","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1017\/S0004972700006924","article-title":"Degrees giving independent edges in a hypergraph","volume":"23","author":"Daykin","year":"1981","journal-title":"Bull. Aust. Math. Soc."},{"key":"10.1016\/j.jcta.2013.04.008_br0040","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/j.jcta.2013.04.008_br0050","doi-asserted-by":"crossref","first-page":"897","DOI":"10.4007\/annals.2007.166.897","article-title":"Hypergraph regularity and the multidimensional Szemer\u00e9di theorem","volume":"166","author":"Gowers","year":"2007","journal-title":"Ann. of Math."},{"key":"10.1016\/j.jcta.2013.04.008_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.jcta.2013.04.008_br0070","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.jcta.2013.04.008_br0080","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s00493-005-0042-2","article-title":"On a hypergraph Tur\u00e1n problem of Frankl","volume":"25","author":"Keevash","year":"2005","journal-title":"Combinatorica"},{"key":"10.1016\/j.jcta.2013.04.008_br0090","author":"Khan"},{"key":"10.1016\/j.jcta.2013.04.008_br0100","author":"Khan"},{"key":"10.1016\/j.jcta.2013.04.008_br0110","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.jcta.2013.04.008_br0120","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. Combin. Theory Ser. B"},{"key":"10.1016\/j.jcta.2013.04.008_br0130","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/j.jcta.2013.04.008_br0140","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":"European J. Combin."},{"key":"10.1016\/j.jcta.2013.04.008_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 Combin."},{"key":"10.1016\/j.jcta.2013.04.008_br0160","series-title":"An Irregular Mind: Szemer\u00e9di is 70","first-page":"1","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.jcta.2013.04.008_br0170","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0963548305007042","article-title":"A Dirac-type theorem for 3-uniform hypergraphs","volume":"15","author":"R\u00f6dl","year":"2006","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.jcta.2013.04.008_br0180","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":"European J. Combin."},{"key":"10.1016\/j.jcta.2013.04.008_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. Combin. Theory Ser. A"},{"key":"10.1016\/j.jcta.2013.04.008_br0200","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/rsa.20108","article-title":"Applications of the regularity lemma for uniform hypergraphs","volume":"28","author":"R\u00f6dl","year":"2006","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/j.jcta.2013.04.008_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. Combin. Theory Ser. A"},{"key":"10.1016\/j.jcta.2013.04.008_br0220","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorisation of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. Lond. Math. Soc."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316513000800?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316513000800?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T11:28:57Z","timestamp":1595762937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316513000800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":22,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["S0097316513000800"],"URL":"https:\/\/doi.org\/10.1016\/j.jcta.2013.04.008","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2013,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcta.2013.04.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}