{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:39:36Z","timestamp":1740105576330,"version":"3.37.3"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003977","name":"ISF","doi-asserted-by":"publisher","award":["620\/13"],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"BSF","doi-asserted-by":"publisher","award":["2012\/107"],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Israeli I-Core"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1016\/j.jctb.2015.03.001","type":"journal-article","created":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T07:00:38Z","timestamp":1427439638000},"page":"220-235","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Bipartite decomposition of random graphs"],"prefix":"10.1016","volume":"113","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2015.03.001_br0010","series-title":"The Mathematics of Paul Erd\u0151s, Vol. II","first-page":"27","article-title":"Neighborly families of boxes and bipartite coverings","author":"Alon","year":"1997"},{"key":"10.1016\/j.jctb.2015.03.001_br0020","doi-asserted-by":"crossref","unstructured":"N. Alon, T. Bohman, H. Huang, More on the bipartite decomposition of random graphs, 2014, manuscript.","DOI":"10.1016\/j.jctb.2015.03.001"},{"year":"2008","series-title":"The Probabilistic Method","author":"Alon","key":"10.1016\/j.jctb.2015.03.001_br0030"},{"year":"1992","series-title":"Poisson Approximation","author":"Barbour","key":"10.1016\/j.jctb.2015.03.001_br0040"},{"issue":"3","key":"10.1016\/j.jctb.2015.03.001_br0050","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0305004100053056","article-title":"Cliques in random graphs","volume":"80","author":"Bollob\u00e1s","year":"1976","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"author":"Chung","key":"10.1016\/j.jctb.2015.03.001_br0060"},{"issue":"8","key":"10.1016\/j.jctb.2015.03.001_br0070","doi-asserted-by":"crossref","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","article-title":"On the addressing problem for loop switching","volume":"50","author":"Graham","year":"1971","journal-title":"Bell Syst. Tech. J."},{"year":"2000","series-title":"Random Graphs","author":"Janson","key":"10.1016\/j.jctb.2015.03.001_br0080"},{"key":"10.1016\/j.jctb.2015.03.001_br0090","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0002-9947-1988-0929670-5","article-title":"Eigensharp graphs: decomposition into complete bipartite subgraphs","volume":"308","author":"Kratzke","year":"1988","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.jctb.2015.03.001_br0100","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(84)90174-2","article-title":"A new proof of a theorem of Graham and Pollak","volume":"49","author":"Peck","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/j.jctb.2015.03.001_br0110","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/jgt.3190060414","article-title":"On the decomposition of Kn into complete bipartite graphs","volume":"6","author":"Tverberg","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.jctb.2015.03.001_br0120","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.jcta.2007.07.006","article-title":"A polynomial space proof of the Graham\u2013Pollak theorem","volume":"115","author":"Vishwanathan","year":"2008","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895615000313?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895615000313?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T22:21:42Z","timestamp":1651616502000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895615000313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":12,"alternative-id":["S0095895615000313"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2015.03.001","relation":{},"ISSN":["0095-8956"],"issn-type":[{"type":"print","value":"0095-8956"}],"subject":[],"published":{"date-parts":[[2015,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bipartite decomposition of random graphs","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.2015.03.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}