{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T03:15:49Z","timestamp":1767150949305,"version":"build-2238731810"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"http:\/\/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 B"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0095-8956(03)00024-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T17:16:12Z","timestamp":1051118172000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Existence of a perfect matching in a random (1+e\u22121)\u2014out bipartite graph"],"prefix":"10.1016","volume":"88","author":[{"given":"Micha\u0142","family":"Karo\u0144ski","sequence":"first","affiliation":[]},{"given":"Boris","family":"Pittel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0095-8956(03)00024-8_BIB1","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0095-8956(86)90077-8","article-title":"Maximum matchings in a class of random graphs","volume":"40","author":"Frieze","year":"1986","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0095-8956(03)00024-8_BIB2","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/S0895480196313790","article-title":"On perfect matchings and hamiltonian cycles in sums of random trees","volume":"12","author":"Frieze","year":"1999","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0095-8956(03)00024-8_BIB3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.19.3.513","article-title":"Average case analysis of a heuristic for the assignment problem","volume":"19","author":"Karp","year":"1994","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0095-8956(03)00024-8_BIB4","series-title":"Matching Theory","author":"Lov\u00e0sz","year":"1986"},{"key":"10.1016\/S0095-8956(03)00024-8_BIB5","first-page":"335","article-title":"The expected node-independence number of random trees","volume":"35","author":"Meir","year":"1974","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. Indag. Math."},{"key":"10.1016\/S0095-8956(03)00024-8_BIB6","series-title":"Nonnegative Matrices","author":"Minc","year":"1988"},{"key":"10.1016\/S0095-8956(03)00024-8_BIB7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<279::AID-RSA6>3.0.CO;2-J","article-title":"The random bipartite nearest neighbor graphs","volume":"15","author":"Pittel","year":"1999","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0095-8956(03)00024-8_BIB8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/rsa.3240050121","article-title":"Matchings in superpositions of (n,n)-bipartite trees","volume":"5","author":"Schmutz","year":"1994","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0095-8956(03)00024-8_BIB9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(80)90172-7","article-title":"Matchings in random regular bipartite digraphs","volume":"31","author":"Walkup","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00024-8_NEWBIB10","doi-asserted-by":"crossref","unstructured":"C. Cooper, A.M. Frieze, On the connectivity of random k-nearest neighbor graphs, Combin. Probab. Comput. 4 (1996) 343\u2013362.","DOI":"10.1017\/S0963548300001711"},{"key":"10.1016\/S0095-8956(03)00024-8_NEWBIB11","unstructured":"V.F. Kolchin, Random Mappings, Optimization Software Inc., New York, 1986."}],"updated-by":[{"DOI":"10.1016\/j.jctb.2020.03.004","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000}}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000248?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000248?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T14:26:41Z","timestamp":1758810401000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0095895603000248"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00024-8","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Existence of a perfect matching in a random (1+e\u22121)\u2014out bipartite graph","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0095-8956(03)00024-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science (USA). All rights reserved.","name":"copyright","label":"Copyright"}]}}