{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:08:46Z","timestamp":1769976526078,"version":"3.49.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0012-365x(83)90247-9","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"145-150","source":"Crossref","is-referenced-by-count":25,"title":["Trees in random graphs"],"prefix":"10.1016","volume":"46","author":[{"given":"P.","family":"Erd\u00f6s","sequence":"first","affiliation":[]},{"given":"Z.","family":"Palka","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(83)90247-9_BIB1","first-page":"223","article-title":"Topological cliques of random graphs","author":"Bollob\u00e1s","year":"1981","journal-title":"J. Combin. Theory (Ser. B)"},{"key":"10.1016\/0012-365X(83)90247-9_BIB2","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."},{"key":"10.1016\/0012-365X(83)90247-9_BIB3","first-page":"17","article-title":"On the evolution of random graphs","volume":"5A","author":"Erd\u00f6s","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"10.1016\/0012-365X(83)90247-9_BIB4","first-page":"151","article-title":"On the size of a maximal induced tree in a random graph","volume":"30","author":"Karo\u0144ski","year":"1980","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(83)90247-9_BIB5","first-page":"104","article-title":"Addendum and erratum to the paper \u201cOn the size of a maximal induced tree in a random graph\u201d","volume":"31","author":"Karo\u0144ski","year":"1981","journal-title":"Math. Slovaca"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83902479?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83902479?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:51:08Z","timestamp":1554907868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83902479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83902479"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90247-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}