{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:04:40Z","timestamp":1725674680753},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_20","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T14:19:29Z","timestamp":1334067569000},"page":"231-242","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Upper Bound on the Density of Universal Random Graphs"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"Domingos","family":"Dellamonica","sequence":"first","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"}]}],"member":"297","reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/rsa.20143","volume":"31","author":"N. Alon","year":"2007","unstructured":"Alon, N., Capalbo, M.: Sparse universal graphs for bounded-degree graphs. Random Structures Algorithms\u00a031(2), 123\u2013133 (2007)","journal-title":"Random Structures Algorithms"},{"key":"20_CR2","first-page":"373","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"N. Alon","year":"2008","unstructured":"Alon, N., Capalbo, M.: Optimal universal graphs with deterministic embedding. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 373\u2013378. ACM, New York (2008)"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/SFCS.2000.892007","volume-title":"41st Annual Symposium on Foundations of Computer Science","author":"N. Alon","year":"2000","unstructured":"Alon, N., Capalbo, M., Kohayakawa, Y., R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Universality and tolerance (extended abstract). In: 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, pp. 14\u201321. IEEE Comput. Soc. Press, Los Alamitos (2000)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-44666-4_20","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"N. Alon","year":"2001","unstructured":"Alon, N., Capalbo, M., Kohayakawa, Y., R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Near-optimum Universal Graphs for Graphs with Bounded Degrees (Extended Abstract). In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, pp. 170\u2013180. Springer, Heidelberg (2001)"},{"issue":"6","key":"20_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00493-007-2182-z","volume":"27","author":"N. Alon","year":"2007","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Embedding nearly-spanning bounded degree trees. Combinatorica\u00a027(6), 629\u2013644 (2007)","journal-title":"Combinatorica"},{"issue":"1","key":"20_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.37236\/278","volume":"17","author":"J. Balogh","year":"2010","unstructured":"Balogh, J., Csaba, B., Pei, M., Samotij, W.: Large bounded degree trees in expanding graphs. Electron. J. Combin. 17(1), Research Paper 6, 9 (2010)","journal-title":"Electron. J. Combin."},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1137\/0402014","volume":"2","author":"S.N. Bhatt","year":"1989","unstructured":"Bhatt, S.N., Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Universal graphs for bounded-degree trees and planar graphs. SIAM J. Discrete Math.\u00a02(2), 145\u2013155 (1989)","journal-title":"SIAM J. Discrete Math."},{"key":"20_CR8","first-page":"741","volume-title":"Annual ACM Symposium on Theory of Computing","author":"M.R. Capalbo","year":"1999","unstructured":"Capalbo, M.R., Kosaraju, S.R.: Small universal graphs. In: Annual ACM Symposium on Theory of Computing, Atlanta, GA, pp. 741\u2013749 (electronic). ACM, New York (1999)"},{"unstructured":"Dellamonica Jr., D., Kohayakawa, Y., R\u00f6dl, V., Ruci\u0144ski, A.: Universality of random graphs. SIAM J. Discrete Math. (to appear)","key":"20_CR9"},{"issue":"1","key":"20_CR10","first-page":"14","volume":"15","author":"D. Dellamonica","year":"2008","unstructured":"Dellamonica Jr., D., Kohayakawa, Y.: An algorithmic Friedman\u2013Pippenger theorem on tree embeddings and applications. Electron. J. Combin. 15(1), Research Paper 127, 14 (2008)","journal-title":"Electron. J. Combin."},{"key":"20_CR11","first-page":"782","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"D. Dellamonica Jr.","year":"2008","unstructured":"Dellamonica Jr., D., Kohayakawa, Y., R\u00f6dl, V., Ruci\u0144ski, A.: Universality of random graphs. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 782\u2013788. ACM, New York (2008)"},{"key":"20_CR12","first-page":"601","volume-title":"Combinatorial Theory and its Applications II (Proc. Colloq., Balatonf\u00fcred, 1969)","author":"A. Hajnal","year":"1970","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of P. Erd\u0151s. In: Combinatorial Theory and its Applications II (Proc. Colloq., Balatonf\u00fcred, 1969), pp. 601\u2013623. North-Holland, Amsterdam (1970)"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/rsa.3240010209","volume":"1","author":"S. Janson","year":"1990","unstructured":"Janson, S.: Poisson approximation for large deviations. Random Structures Algorithms\u00a01(2), 221\u2013229 (1990)","journal-title":"Random Structures Algorithms"},{"key":"20_CR14","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02771528","volume":"142","author":"S. Janson","year":"2004","unstructured":"Janson, S., Oleszkiewicz, K., Ruci\u0144ski, A.: Upper tails for subgraph counts in random graphs. Israel J. Math.\u00a0142, 61\u201392 (2004)","journal-title":"Israel J. Math."},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20224","volume":"33","author":"A. Johansson","year":"2008","unstructured":"Johansson, A., Kahn, J., Vu, V.H.: Factors in random graphs. Random Struct. Algorithms\u00a033(1), 1\u201328 (2008)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"20_CR17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1017\/S0963548307008619","volume":"17","author":"H.A. Kierstead","year":"2008","unstructured":"Kierstead, H.A., Kostochka, A.V.: A short proof of the hajnal-szemer\u00e9di theorem on equitable colouring. Combinatorics, Probability & Computing\u00a017(2), 265\u2013270 (2008)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00493-010-2483-5","volume":"30","author":"H.A. Kierstead","year":"2010","unstructured":"Kierstead, H.A., Kostochka, A.V., Mydlarz, M., Szemer\u00e9di, E.: A fast algorithm for equitable coloring. Combinatorica\u00a030(2), 217\u2013224 (2010)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,5]],"date-time":"2020-07-05T17:54:46Z","timestamp":1593971686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}