{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T16:03:48Z","timestamp":1747584228071},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1007\/bf01788097","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T07:37:00Z","timestamp":1119166620000},"page":"227-231","source":"Crossref","is-referenced-by-count":15,"title":["Induced trees in sparse random graphs"],"prefix":"10.1007","volume":"2","author":[{"given":"W. Fernandez","family":"de la Vega","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01788097_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","volume":"1","author":"M. Ajtai","year":"1981","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: The longest path in a random graph. Combinatorica1, 1\u201312 (1981)","journal-title":"Combinatorica"},{"key":"BF01788097_CR2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0012-365X(83)90247-9","volume":"46","author":"P. Erd\u00f6s","year":"1983","unstructured":"Erd\u00f6s, P. Palka, Z.: Trees in random graphs. Discrete Math.46, 145\u2013150 (1983)","journal-title":"Discrete Math."},{"key":"BF01788097_CR3","first-page":"17","volume":"5A","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P. R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci.5A, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"BF01788097_CR4","unstructured":"Fernandez de la Vega, W.: Trees in sparse random graphs (submitted)"},{"key":"BF01788097_CR5","first-page":"335","volume":"14","author":"W. Fernandez de la Vega","year":"1979","unstructured":"Fernandez de la Vega, W.: Long paths in random graphs, Stud. Sci. Math. Hung.14, 335\u2013340 (1979)","journal-title":"Stud. Sci. Math. Hung."},{"key":"BF01788097_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Sipser, M.: Maximum matchings in sparse random graphs. In: Proc. 22nd Annual Symposium on Foundations of Computer Science pp. 364\u2013375, (1981)","DOI":"10.1109\/SFCS.1981.21"},{"key":"BF01788097_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2307\/3212147","volume":"7","author":"T.G. Kurtz","year":"1970","unstructured":"Kurtz, T.G.: Solutions of ordinary differential equations as limits of pure jump Markov processes. J. Appl. Probab.7, 49\u201358 (1970)","journal-title":"J. Appl. Probab."},{"issue":"N3","key":"BF01788097_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(83)90034-8","volume":"23","author":"A. Marchetti-Spaccamela","year":"1983","unstructured":"Marchetti-Spaccamela, A. Protasi, M.: The largest tree in a random graph. Theor. Comput. Sci.23 (N3), 273\u2013286 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"BF01788097_CR9","first-page":"151","volume":"30","author":"M. Karo\u0144ski","year":"1980","unstructured":"Karo\u0144ski, M. Palka, Z.: On the size of a maximal induced tree in a random graph. Math. Slovaca30, 151\u2013155 (1980)","journal-title":"Math. Slovaca"},{"key":"BF01788097_CR10","first-page":"107","volume":"31","author":"M. Karo\u0144ski","year":"1981","unstructured":"Karo\u0144ski, M. Palka, Z.: Addendum and erratum to the paper \u201cOn the size of a maximal induced tree in a random graph\u201d. Math. Slovaca31, 107\u2013108 (1981)","journal-title":"Math. Slovaca"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788097.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788097\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T09:12:23Z","timestamp":1557479543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF01788097"],"URL":"https:\/\/doi.org\/10.1007\/bf01788097","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}