{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T17:01:46Z","timestamp":1769014906751,"version":"3.49.0"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1007\/bf02579276","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T18:17:40Z","timestamp":1174587460000},"page":"1-7","source":"Crossref","is-referenced-by-count":84,"title":["Largest random component of ak-cube"],"prefix":"10.1007","volume":"2","author":[{"given":"M.","family":"Ajtai","sequence":"first","affiliation":[]},{"given":"J.","family":"Koml\u00f3s","sequence":"additional","affiliation":[]},{"given":"E.","family":"Szemer\u00e9di","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579276_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","volume":"1","author":"M. Ajtai","year":"1981","unstructured":"M. Ajtai, J. Koml\u00f3s andE. Szemer\u00e9di, The longest path in a random graph,Combinatorica 1 (1981) 1\u201312.","journal-title":"Combinatorica"},{"key":"BF02579276_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0898-1221(81)90137-1","volume":"5","author":"P. Erd\u0151s","year":"1979","unstructured":"P. Erd\u0151s andJ. Spencer. Evolution of the n-cube,Computers and Math. with Applications 5 (1979) 33\u201340.","journal-title":"Computers and Math. with Applications"},{"key":"BF02579276_CR3","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L. H. Harper","year":"1966","unstructured":"L. H. Harper, Optimal numberings and isoperimetric problems on graphs,Journal of Comb. Th. 1 (1966) 358\u2013394.","journal-title":"Journal of Comb. Th."},{"key":"BF02579276_CR4","doi-asserted-by":"crossref","unstructured":"T. E. Harris,The theory of branching processes, Springer (1963).","DOI":"10.1007\/978-3-642-51866-9"},{"key":"BF02579276_CR5","unstructured":"J. Koml\u00f3s, M. Sulyok andE. Szemer\u00e9di. Underdogs in a random graph,submitted to Studia Sci. Math. Hung."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579276.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579276\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:01Z","timestamp":1558183501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["BF02579276"],"URL":"https:\/\/doi.org\/10.1007\/bf02579276","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}