{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T13:55:05Z","timestamp":1697550905481},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8508,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0095-8956(90)90122-g","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"289-293","source":"Crossref","is-referenced-by-count":2,"title":["A generalization of an inequality of Stepanov"],"prefix":"10.1016","volume":"48","author":[{"given":"Lajos","family":"Tak\u00e1cs","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(90)90122-G_BIB1","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","article-title":"Random graphs","volume":"30","author":"Gilbert","year":"1959","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0095-8956(90)90122-G_BIB2","series-title":"Theory and Applications of Graphs","first-page":"314","article-title":"Random clumps, graphs, and polymer solutions","volume":"Vol. 642","author":"Kennedy","year":"1978"},{"key":"10.1016\/0095-8956(90)90122-G_BIB3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(78)90009-9","article-title":"The expected linearity of a sample equivalence algorithm","volume":"6","author":"Knuth","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0095-8956(90)90122-G_BIB4","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1137\/1130083","article-title":"Some recurrence formulas for probability of connectedness of random graphs","volume":"30","author":"Kordecki","year":"1985","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/0095-8956(90)90122-G_BIB5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/1114052","article-title":"Combinatorial algebra and random graphs","volume":"14","author":"Stepanov","year":"1969","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/0095-8956(90)90122-G_BIB6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/1115004","article-title":"On the probability of connectedness of a random graph gm(t)","volume":"15","author":"Stepanov","year":"1970","journal-title":"Theory Probab. Appl."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090122G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090122G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:51:19Z","timestamp":1548881479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569090122G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["009589569090122G"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(90)90122-g","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}