{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T22:08:04Z","timestamp":1574114884803},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"URL":"http:\/\/www.springer.com\/tdm","start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"delay-in-days":0,"content-version":"tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf01196135","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:51:37Z","timestamp":1108738297000},"page":"109-123","source":"Crossref","is-referenced-by-count":123,"title":["Blow-up Lemma"],"prefix":"10.1007","volume":"17","author":[{"given":"J\ufffdnos","family":"Koml\ufffds","sequence":"first","affiliation":[]},{"given":"G\ufffdbor N.","family":"S\ufffdrk\ufffdzy","sequence":"additional","affiliation":[]},{"given":"Endre","family":"Szemer\ufffddi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"479","volume":"33","author":"N. Alon","year":"1993","unstructured":"N. Alon, R. Duke, H. Leffman, V. R\ufffddl, andR. Yuster: Algorithmic aspects of the regularity lemma.FOCS,33 (1993), 479?481; Journal of Algorithms,16 (1994), 80?109.","journal-title":"FOCS"},{"key":"CR2","unstructured":"N. Alon andE. Fischer: 2-factors in dense graphs, Discrete Math., to appear."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0095-8956(84)90047-9","volume":"37","author":"N. Alon","year":"1984","unstructured":"N. Alon, S. Friedland, G. Kalai: Regular subgraphs of almost regular graphs,J. Combinatorial Theory, B37 (1984), 79?91. See alsoN. Alon, S. Friedland, G. Kalai: Every 4-regular graph plus an edge contains a 3-regular subgraph,J. Combinatorial Theory, B37 (1984), 91?92.","journal-title":"J. Combinatorial Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02350627","volume":"8","author":"N. Alon","year":"1992","unstructured":"N. Alon andR. Yyster: AlmostH-factors in dense graphs,Graphs and Combinatorics,8 (1992), 95?102.","journal-title":"Graphs and Combinatorics"},{"key":"CR5","unstructured":"N. Alon andR. Yuster:H-factors in dense graphs,J. Combinatorial Theory, Ser. B, to appear."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","volume":"34","author":"V. Ghv\ufffdtal","year":"1983","unstructured":"V. Ghv\ufffdtal, V. R\ufffddl, E. Szemer\ufffddi, andW. T. Trotter Jr.: The Ramsey number of a graph with bounded maximum degree,Journal of Combinatorial Theory, B34 (1983), 239?243.","journal-title":"Journal of Combinatorial Theory"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K. Corr\ufffddi","year":"1963","unstructured":"K. Corr\ufffddi andA. Hajnal: On the maximal number of independent circuits in a graph,Acta Math. Acad. Sci. Hung.,14 (1963), 423?439.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K?v\ufffdri","year":"1954","unstructured":"T. K?v\ufffdri, Vera T. S\ufffds, andP. Tur\ufffdn: On a problem of Zarankiewicz,Colloq. Math.,3 (1954), 50?57.","journal-title":"Colloq. Math."},{"key":"CR9","first-page":"1089","volume":"52","author":"P. Erd?s","year":"1946","unstructured":"P. Erd?s andA. H. Stone: On the structure of linear graphs,Bull. Amer. Math. Soc.,52 (1946), 1089?1091.","journal-title":"Bull. Amer. Math. Soc."},{"key":"CR10","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 andE. Szemer\ufffddi: Proof of a conjecture of Erd?s,Combinatorial Theory and its Applications vol. II (P. Erd?s, A. R\ufffdnyi and V. T. S\ufffds (eds.), Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam (1970), 601?623."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1017\/S0963548300001620","volume":"4","author":"J. Koml\ufffds","year":"1995","unstructured":"J. Koml\ufffds, G. N. S\ufffdrk\ufffdzy, andE. Szemer\ufffddi: Proof of a packing conjecture of Bollob\ufffds, AMS Conference on Discrete Mathematics, DeKalb, Illinois (1993),Combinatorics, Probability and Computing,4 (1995), 241?255.","journal-title":"Combinatorics, Probability and Computing"},{"key":"CR12","unstructured":"J. Koml\ufffds, G. N. S\ufffdrk\ufffdzy, andE. Szemer\ufffddi: On the P\ufffdsa-Seymour conjecture, submitted to theJournal of Graph Theory."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<193::AID-RSA12>3.0.CO;2-P","volume":"9","author":"J. Koml\ufffds","year":"1996","unstructured":"J. Koml\ufffds, G. N. S\ufffdrk\ufffdzy, andE. Szemer\ufffddi: On the square of a Hamiltonian cycle in dense graphs, Proceedings of Atlanta'95,Random Structures and Algorithms,9 (1996), 193?211.","journal-title":"Random Structures and Algorithms"},{"key":"CR14","unstructured":"J. Koml\ufffds, G. N. S\ufffdrk\ufffdzy, andE. Szemer\ufffddi: Proof of the Alon-Yuster conjecture, in preparation."},{"key":"CR15","unstructured":"J. Koml\ufffds andM. Simonovits: Szemer\ufffddi's Regularity Lemma and its applications in graph theory, Bolyai Society Mathematical Studies 2,Combinatorics, Paul Erd?s is Eighty (Volume 2), (D. Mikl\ufffds, V. T. S\ufffds, T. Sz?nyi eds.), Keszthely (Hungary) (1993), Budapest (1996), 295?352."},{"key":"CR16","unstructured":"E. Szemer\ufffddi: Regular partitions of graphs, Colloques Internationaux C.N.R.S. N o 260 ?Probl\ufffdmes Combinatoires et Th\ufffdorie des Graphes, Orsay (1976), 399?401."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01196135.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01196135\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01196135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:41:41Z","timestamp":1556728901000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":16,"journal-issue":{"published-print":{"date-parts":[[1997,3]]},"issue":"1"},"alternative-id":["BF01196135"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01196135","relation":{"cites":[]},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":["Discrete Mathematics and Combinatorics","Computational Mathematics"]}}