{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:04Z","timestamp":1725485584320},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_3","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:58:05Z","timestamp":1181185085000},"page":"25-34","source":"Crossref","is-referenced-by-count":3,"title":["An Algorithmic Embedding of Graphs via Perfect Matchings"],"prefix":"10.1007","author":[{"given":"Vojtech","family":"R\u00f6dl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michelle","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jagm.1994.1005","volume":"16","author":"N. Alon","year":"1994","unstructured":"N. Alon, R. Duke, H. Leffman, V. R\u00f6dl, and R. Yuster, \u201cThe algorithmic aspects of the regularity lemma\u201d, Journal of Algorithms, vol. 16 (1994), pp. 80\u2013109.","journal-title":"Journal of Algorithms"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"N. Alon, V. R\u00f6dl, and A. Ruci\u0144ski, \u201cPerfect matchings in \u03b5-regular graphs\u201d, The Electronic J. of Combin., vol. 5(1) (1998), # R13.","DOI":"10.37236\/1351"},{"key":"3_CR3","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"N. Alon and J. Spencer, The Probabilistic Method, Wiley, New York, 1992."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/0097-3165(73)90005-8","volume":"14","author":"P. Erd\u00f6s","year":"1973","unstructured":"P. Erd\u00f6s and J. L. Selfridge, \u201cOn a combinatorial game\u201d, Journal of Combinatorial Theory, Series A, vol. 14 (1973), pp. 298\u2013301.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"3_CR5","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, \u201cProof of a conjecture of Erd\u00f6s\u201d, Combinatorial Theory and its Applications, vol. II (P. Erd\u00f3s, A. R\u00e9nyi, and V.T. S\u00f3s eds), Colloq. Math. Soc. J. Bolyai 4, North Holland, Amsterdam, 1970, pp. 601\u2013623."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. H. R. M. Karp","year":"1973","unstructured":"J. E. Hopcroft R. M. Karp, \u201cAn n5\/2 algorithm for maximum matchings in bipartite graphs\u201d, SIAM J. Comput, vol. 2 (1973), pp. 225\u2013231.","journal-title":"SIAM J. Comput"},{"key":"3_CR7","volume-title":"Topics in Random Graphs","author":"S. Janson","year":"1999","unstructured":"S. Janson, T. \u0142uczak, and A. Ruci\u0144ski, Topics in Random Graphs, Wiley, New York, 1999."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J. Koml\u00f3s","year":"1997","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy, and E. Szemer\u00e9di, \u201cBlow-up lemma\u201d, Combinatorica, vol. 17 (1997), pp. 109\u2013123.","journal-title":"Combinatorica"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<297::AID-RSA5>3.0.CO;2-Q","volume":"12","author":"J. Koml\u00f3s","year":"1998","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy, and E. Szemer\u00e9di, \u201cAn algorithmic version of the blowup lemma\u201d, Random Structures and Algorithms, vol. 12 (1998), pp. 297\u2013312.","journal-title":"Random Structures and Algorithms"},{"key":"3_CR10","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy and E. Szemer\u00e9di \u201cOn the P\u00f3sa-Seymour conjecture J. Graph Theory\u201d, Journal of Graph Theory, to appear"},{"key":"3_CR11","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy and E. Szemer\u00e9di \u201cProof of the Alon-Yuster conjecture\u201d submitted"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"P. Raghavan, \u201cProbabilistic construction of deterministic algorithms: Approximating packing integer programs\u201d, Journal of Computer and System Sciences, vol. 37 (1988), pp. 130\u2013143.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR13","unstructured":"V. R\u00f6dl and A. Ruci\u0144ski, \u201cPerfect matchings in \u03b5-regular graphs and the blow-up lemma\u201d, submitted."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","volume":"25","author":"N. Sauer","year":"1978","unstructured":"N. Sauer and J. Spencer, \u201cEdge disjoint placement of graphs\u201d, J. Comb. Th. B, vol. 25 (1978), pp. 295\u2013302.","journal-title":"J. Comb. Th. B"},{"key":"3_CR15","first-page":"399","volume":"260","author":"E. Szemer\u00e9di","year":"1978","unstructured":"E. Szemer\u00e9di \u201cPartitions of graphs\u201d Problems Combin. et Theorie des graphes, Edition du C.N.R.S. vol. 260 (1978), pp. 399\u2013402.","journal-title":"Problems Combin. et Theorie des graphes, Edition du C.N.R.S."}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T20:37:21Z","timestamp":1587587841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}