M. Ajtai, J. Komlós, and E. Szemerédi, On a conjecture of Loebl, Graph theory, combinatorics, and algorithms, vol.1, pp.1135-1146, 1992.

N. Alon and J. H. Spencer, The probabilistic method, Wiley-Interscience Series in Discrete Mathematics and Optimization, 2008.

S. Brandt and E. Dobson, The Erd?s-Sós conjecture for graphs of girth 5, Discr. Math, vol.150, pp.411-414, 1996.

O. Cooley, Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs, Discr. Math, vol.309, issue.21, pp.6190-6228, 2009.

P. Erd?s, Z. Füredi, M. Loebl, and V. T. Sós, Discrepancy of trees, Studia Sci. Math. Hungar, vol.30, issue.1-2, pp.47-57, 1995.

P. E. Haxell, ;. Hladký, J. Komlós, D. Piguet, M. Simonovits et al., The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition, SIAM J. Disc. Math, vol.36, issue.3, pp.945-982, 2001.

]. J. Hkp-+-17b, J. Hladký, D. Komlós, M. Piguet, M. Simonovits et al., Szemerédi. The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result, SIAM J. Disc. Math, vol.31, issue.2, pp.1072-1148, 2017.

J. Hladký and D. Piguet, Loebl-Komlós-Sós Conjecture: dense case, J. Combin. Theory Ser. B, vol.116, pp.123-190, 2016.

J. Hladký, D. Piguet, M. Simonovits, M. Stein, and E. Szemerédi, The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs, Electron. Res. Ann. Math. Sci, vol.22, pp.1-11, 2015.

C. Mcdiarmid, On the method of bounded differences, Surveys in combinatorics, vol.141, pp.148-188, 1989.

D. Piguet and M. J. Stein, An approximate version of the Loebl-Komlós-Sós conjecture, J. Combin. Theory Ser. B, vol.102, issue.1, pp.102-125, 2012.

J. Saclé and M. Wo?niak, A note on the Erd?s-Sós conjecture for graphs without C 4, J. Combin. Theory Ser. B, vol.70, issue.2, pp.229-234, 1997.

Y. Zhao, Proof of the (n/2?n/2?n/2) conjecture for large n, Electron. J. Combin, vol.18, issue.1, p.61, 2011.