The approximate Loebl-Komlós-Sós Conjecture

Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi

Type: Preprint

Publication Date: 2012-01-01

Citations: 5

DOI: https://doi.org/10.48550/arxiv.1211.3050

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs	2015	Endre Szemerédi Maya Stein Miklós Simonovits Diana Piguet Jan Hladký
+	AND EMBEDDING TREES IN SPARSE GRAPHS	2015	Jan Hladk Diana Piguet Mikl ́ Os Maya Stein
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	An approximate version of the Loebl-Komlós-Sós conjecture	2007	Diana Piguet Maya Stein
+	Loebl–Komlós–Sós Conjecture: Dense case	2015	Jan Hladký Diana Piguet
+ PDF Chat	Loebl-Komlós-Sós Conjecture: dense case	2009	Oliver Cooley Jan Hladký Diana Piguet
+	Szemerédi’s Regularity Lemma for Sparse Graphs	1997	Yoshiharu Kohayakawa
+	An approximate version of the Loebl-Komlos-Sos conjecture	2007	Diana Piguet Maya Stein
+	An approximate version of the Loebl-Komlos-Sos conjecture	2007	Diana Piguet Maya Stein
+ PDF Chat	An approximate version of the Loebl–Komlós–Sós conjecture	2011	Diana Piguet Maya Stein
+	Szémeredi's regularity lemma and its applications in combinatorics	2006	Jonas Hägglund
+	The sparse regularity lemma and its applications	2005	Stefanie Gerke Angelika Steger
+	A sparse regular approximation lemma	2017	Guy Moshkovitz A. Shapira
+	A blow-up lemma for approximate decompositions	2016	Jaehoon Kim Daniela Kühn Deryk Osthus Mykhaylo Tyomkyn
+ PDF Chat	Holes in Graphs	2001	Yuejian Peng Vojtěch Rödl Andrzej Ruciński
+	A Sparse Regular Approximation Lemma	2016	Guy Moshkovitz A. Shapira
+	A Sparse Regular Approximation Lemma	2016	Guy Moshkovitz A. Shapira

Works That Cite This (5)

Action	Title	Year	Authors
+ PDF Chat	Embedding Graphs into Larger Graphs: Results, Methods, and Problems	2019	Miklós Simonovits Endre Szemerédi
+ PDF Chat	The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs	2015	Endre Szemerédi Maya Stein Miklós Simonovits Diana Piguet Jan Hladký
+ PDF Chat	The History of Degenerate (Bipartite) Extremal Graph Problems	2013	Zoltán Füredi Miklós Simonovits
+	AND EMBEDDING TREES IN SPARSE GRAPHS	2015	Jan Hladk Diana Piguet Mikl ́ Os Maya Stein
+ PDF Chat	Proof of the $(n/2-n/2-n/2)$ Conjecture for Large $n$	2011	Yi Zhao

Works Cited by This (34)

Action	Title	Year	Authors
+	Tight Bounds for Embedding Bounded Degree Trees	2010	Béla Csaba Judit Nagy-György Ian Levitt Endre Szemerédi
+	Szemerédi’s Regularity Lemma for Sparse Graphs	1997	Yoshiharu Kohayakawa
+	Szemeredi''s Regularity Lemma and its applications in graph theory	1995	János Komlós Miklós Simonovits
+	None	2000	E. J. Cockayne O. Favaron Christina M. Mynhardt Joël Puech
+ PDF Chat	Embedding large subgraphs into dense graphs	2009	Daniela Kühn Deryk Osthus
+	A randomized embedding algorithm for trees	2010	Benny Sudakov J. Vondrák
+	Every Graph with a Positive Cheeger Constant Contains a Tree with a Positive Cheeger Constant	1997	Itaı Benjamini Oded Schramm
+	The Komlós–Sós conjecture for graphs of girth 7	2000	Sara Nadiv Soffer
+	The Erdős-Sós conjecture for graphs of girth 5	1996	Stephan Brandt Edward Dobson
+	The longest path in a random graph	1981	Miklós Ajtai János Komlós Endre Szemerédi