{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:18:50Z","timestamp":1773271130143,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424703","type":"print"},{"value":"9783540446668","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_20","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:58:07Z","timestamp":1178197087000},"page":"170-180","source":"Crossref","is-referenced-by-count":12,"title":["Near-optimum Universal Graphs for Graphs with Bounded Degrees"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Capalbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiharu","family":"Kohayakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Endre","family":"Szemer\u00e9di","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon and V. Asodi, Sparse universal graphs, Journal of Computational and Applied Mathematics, to appear.","DOI":"10.1016\/S0377-0427(01)00455-1"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"N. Alon, M. Capalbo, Y. Kohayakawa, V. R\u00f6dl, A. Ruci\u0144ski, and E. Szemer\u00e9di, Universality and tolerance, Proceedings of the 41st IEEE Annual Symposium on FOCS, pp. 14\u201321, 2000.","DOI":"10.1109\/SFCS.2000.892007"},{"key":"20_CR3","first-page":"21","volume":"12","author":"L. Babai","year":"1982","unstructured":"L. Babai, F. R. K. Chung, P. Erdos, R. L. Graham, J. Spencer, On graphs which contain all sparse graphs, Ann. Discrete Math., 12 (1982), pp. 21\u201326.","journal-title":"Ann. Discrete Math."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1137\/0402014","volume":"2","author":"S. N. Bhatt","year":"1989","unstructured":"S. N. Bhatt, F. Chung, F. T. Leighton and A. Rosenberg, Universal graphs for bounded-degree trees and planar graphs, SI AM J. Disc. Math. 2 (1989), 145\u2013155.","journal-title":"SI AM J. Disc. Math."},{"key":"20_CR5","unstructured":"S. N. Bhatt and E. Leiserson, How to assemble tree machines, Advances in Computing Research, F. Preparata, ed., 1984."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"M. Capalbo, A small universal graph for bounded-degree planar graphs, SODA (1999), 150\u2013154.","DOI":"10.1145\/301250.301446"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0095-8956(78)90072-2","volume":"24","author":"F. R. K. Chung","year":"1978","unstructured":"F. R. K. Chung and R. L. Graham, On graphs which contain all small trees, J. Combin. Theory Ser. B, 24 (1978) pp. 14\u201323.","journal-title":"J. Combin. Theory Ser. B"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1111\/j.1749-6632.1979.tb32784.x","volume":"319","author":"F. R. K. Chung","year":"1979","unstructured":"F. R. K. Chung and R. L. Graham, On universal graphs, Ann. New York Acad. Sci., 319 (1979) pp. 136\u2013140.","journal-title":"Ann. New York Acad. Sci."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1112\/jlms\/s2-27.2.203","volume":"27","author":"F. R. K. Chung","year":"1983","unstructured":"F. R. K. Chung and R. L. Graham, On universal graphs for spanning trees, Proc. London Math. Soc., 27 (1983) pp. 203\u2013211.","journal-title":"Proc. London Math. Soc."},{"key":"20_CR10","unstructured":"F. R. K. Chung, R. L. Graham, and N. Pippenger, On graphs which contain all small trees II, Proc. 1976 Hungarian Colloquium on Combinatorics, 1978, pp. 213\u2013223."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"M. Capalbo and S. R. Kosaraju, Small universal graphs, STOC (1999), 741\u2013749.","DOI":"10.1145\/301250.301446"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1137\/0604055","volume":"4","author":"F. R. K. Chung","year":"1983","unstructured":"F. R. K. Chung, A. L. Rosenberg, and L. Snyder, Perfect storage representations for families of data structures, SI AM J. Alg. Disc. Methods., 4 (1983), pp. 548\u2013565.","journal-title":"SI AM J. Alg. Disc. Methods."},{"key":"20_CR13","first-page":"71","volume":"7","author":"J. Friedman","year":"1987","unstructured":"J. Friedman and N. Pippenger, Expanding graphs contain all small trees, Combi-natorica, 7 (1987), pp. 71\u201376.","journal-title":"Combi-natorica"},{"key":"20_CR14","series-title":"Colloq. Math Soc. J. Bolyai","first-page":"601","volume-title":"Combinatorial Theory and its Applications","author":"A. Hajnal","year":"1970","unstructured":"A. Hajnal and E. Szemer\u00e9di, Proof of a conjecture of Erdos, in Combinatorial Theory and its Applications, Vol. II (P. Erdos, A. R\u00e9nyi, and V. T. S\u00f3s, eds.), Colloq. Math Soc. J. Bolyai 4, North Holland, Amsterdam 1970, 601\u2013623."},{"key":"20_CR15","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M. D. Plummer, Matching Theory, North Holland, Amsterdam (1986)."},{"key":"20_CR16","first-page":"225","volume":"11","author":"V. R\u00f6dl","year":"1981","unstructured":"V. R\u00f6dl, A note on universal graphs, Ars Combin., 11 (1981), 225\u2013229.","journal-title":"Ars Combin."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T13:26:26Z","timestamp":1556371586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}