{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:46Z","timestamp":1725663106700},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540151982"},{"type":"electronic","value":"9783540393023"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15198-2_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:11:15Z","timestamp":1330193475000},"page":"139-144","source":"Crossref","is-referenced-by-count":1,"title":["On the maximum size of random trees"],"prefix":"10.1007","author":[{"given":"M.","family":"Protasi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"8_CR1","unstructured":"P. Erd\u00f6s, Z. Palka: Trees in random graphs, Discr. Math., Vol. 46 (1983)."},{"key":"8_CR2","unstructured":"P. Erd\u00f6s, A. Renyi: On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci., Vol. 5A (1960)."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"J. Friedman: Constructing 0 (n log n) size monotone formulae for the k-th elementary symmetric polynomial of n boolean variables, Proc. 25th Symp. on Foundations of Computer Science (1984).","DOI":"10.1109\/SFCS.1984.715953"},{"key":"8_CR4","volume-title":"Computers and intractability. A guide to the theory of NP completeness","author":"M. R. Garey","year":"1978","unstructured":"M.R. Garey, D.S. Johnson: Computers and intractability. A guide to the theory of NP completeness, Freeman, San Francisco (1978)."},{"key":"8_CR5","unstructured":"M. Karonski, Z. Palka: On the size of a maximal induced tree in a random graph, Math. Slovaca, Vol. 30 (1980)."},{"key":"8_CR6","unstructured":"A. Marchetti Spaccamela, M. Protasi: The largest tree in a random graph, Theor. Comp. Sci., Vol. 23 (1983)."},{"key":"8_CR7","unstructured":"Z. Palka, A. Rucinski: On the order of the largest induced tree in a random graph, (to appear)."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"M. Protasi, M. Talamo: A new probabilistic model for the study of algorithmic properties of random graph problems, Proc. Conference on Foundations of Computation Theory, Borgholm, Lect. Notes in Comp. Sci., Springer Verlag (1983).","DOI":"10.1007\/3-540-12689-9_118"},{"key":"8_CR9","unstructured":"M. Protasi, M. Talamo: A general analysis of the max independent set and related problems on random graphs, Tech. Rep. n. 3\/84, Dipartimento di Matematica, Universit\u00e0 dell'Aquila (1984)."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15198-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:58:04Z","timestamp":1619557084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15198-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540151982","9783540393023"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-15198-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}