Blow-up Lemma

János Komlós, Gábor N. Sárközy, Endre Szemerédi

Type: Article

Publication Date: 1997-03-01

Citations: 274

DOI: https://doi.org/10.1007/bf01196135

Similar Works

Action	Title	Year	Authors
+	Lemma	2017	D. Kranz
+	Loose almost blowing-up and related properties	2001	Paul C. Shields
+	Closing lemmas	2012	D. V. Anosov Е. В. Жужома
+	A quantitative version of the Blow-up Lemma	2014	Gábor N. Sárközy
+	Pumping Lemma	2007	Pradip K. Srimani S. F. B. Nasir
+	Proof	2016
+	Proof	2003	Rupert Featherstone
+	Proof	2014
+	PROOF	2013
+	Proof	2021
+	Proof	2020	Renford Bambrough
+	Proof	2013
+	Proof	2012
+	Proof	2011	Jan W. Gooch
+	Proof	2011	Jan W. Gooch
+	Proof	2017
+	Proof	2017
+	Proof	2014	Holm Tetens
+	Proof	2007
+	Proof	2009

Action	Title	Year	Authors
+	An Approximate Blow-up Lemma for Sparse Hypergraphs	2021	Peter Allen Julia Böttcher Eng Keat Hng Jozef Skokan Ewan Davies
+	Subdivisions with Distance Constraints in Large Graphs	2014	Alexander Halperin
+	An approximate blow-up lemma for sparse pseudorandom graphs	2013	Peter Allen Julia Böttcher Hiệp Hàn Yoshiharu Kohayakawa Yury Person
+	A blow-up lemma for approximate decompositions	2017	Jaehoon Kim Daniela Kühn Deryk Osthus Mykhaylo Tyomkyn
+ PDF Chat	Near-perfect clique-factors in sparse pseudorandom graphs	2018	Jie Han Yoshiharu Kohayakawa Yury Person
+	Locating any two vertices on Hamiltonian cycles in large graphs	2020	Weihua He Hao Li Qiang Sun
+	Ramsey numbers for bipartite graphs with small bandwidth	2015	Guilherme Oliveira Mota Gábor N. Sárközy Mathias Schacht Anusch Taraz
+	Sparse partition universal graphs for graphs of bounded degree	2011	Yoshiharu Kohayakawa Vojtěch Rödl Mathias Schacht Endre Szemerédi
+	Proof of the Seymour Conjecture for Large Graphs	1998	Endre Szemer
+	Finding Hamilton cycles in robustly expanding digraphs	2012	Demetres Christofides Peter Keevash Daniela Kühn Deryk Osthus

Action	Title	Year	Authors
+	Szemeredi''s Regularity Lemma and its applications in graph theory	1995	János Komlós Miklós Simonovits
+	On the square of a Hamiltonian cycle in dense graphs	1996	J�nos Koml�s G�bor N. S�rk�zy Endre Szemer�di
+	Proof of a Packing Conjecture of Bollobás	1995	János Komlós Gábor N. Sárközy Endre Szemerédi
+	H-Factors in Dense Graphs	1996	Noga Alon Raphael Yuster
+	Regular subgraphs of almost regular graphs	1984	Noga Alon Shmuel Friedland Gil Kalai
+	2-factors in dense graphs	1996	Noga Alon Eldar Fischer
+ PDF Chat	AlmostH-factors in dense graphs	1992	Noga Alon Raphael Yuster
+ PDF Chat	On the structure of linear graphs	1946	Paul Erdős A. H. Stone
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi
+	The Ramsey number of a graph with bounded maximum degree	1983	C Chvatál V. Rödl Endre Szemerédi W. T. Trotter