{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:13Z","timestamp":1740155953760,"version":"3.37.3"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61373019"],"award-info":[{"award-number":["61373019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,12]]},"abstract":"<jats:p> A matching of a [Formula: see text]-uniform hypergraph is a set of pairwise disjoint edges. A [Formula: see text]-matching in a [Formula: see text]-uniform hypergraph [Formula: see text] is a matching of size [Formula: see text]. Let [Formula: see text] be a [Formula: see text]-uniform hypergraph of order [Formula: see text] and [Formula: see text]. If [Formula: see text] for any two adjacent vertices [Formula: see text], and [Formula: see text], then [Formula: see text] contains a [Formula: see text]-matching. This result is an extension of a work of Bollob\u00e1s, Daykin and Erd\u0151s [Sets of independent edges of a hypergraph, Quart. J. Math. Oxford 21 (1976) 25\u201332]. <\/jats:p>","DOI":"10.1142\/s1793830917500720","type":"journal-article","created":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T05:04:55Z","timestamp":1508389495000},"page":"1750072","source":"Crossref","is-referenced-by-count":2,"title":["d-matching in k-uniform hypergraphs"],"prefix":"10.1142","volume":"09","author":[{"given":"Yi","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Tsinghua University, Beijing 100084, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9461-0640","authenticated-orcid":false,"given":"Mei","family":"Lu","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Tsinghua University, Beijing 100084, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2017,12,13]]},"reference":[{"key":"S1793830917500720BIB001","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/27.1.25"},{"key":"S1793830917500720BIB002","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700006924"},{"key":"S1793830917500720BIB003","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"S1793830917500720BIB004","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey M. R.","key":"S1793830917500720BIB005"},{"key":"S1793830917500720BIB006","doi-asserted-by":"publisher","DOI":"10.1137\/080729657"},{"key":"S1793830917500720BIB007","doi-asserted-by":"publisher","DOI":"10.1137\/10080796X"},{"key":"S1793830917500720BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20139"},{"key":"S1793830917500720BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2012.11.005"},{"key":"S1793830917500720BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.02.001"},{"key":"S1793830917500720BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-008-0787-7"},{"key":"S1793830917500720BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.05.008"},{"key":"S1793830917500720BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-008-2295-z"},{"key":"S1793830917500720BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.10.002"},{"key":"S1793830917500720BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.04.006"},{"key":"S1793830917500720BIB016","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-22.2.107"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T10:24:17Z","timestamp":1569320657000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":16,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2017,12,13]]},"published-print":{"date-parts":[[2017,12]]}},"alternative-id":["10.1142\/S1793830917500720"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500720","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}