A version of the Loebl–Komlós–Sós conjecture for skew trees. (August 2020)

• Record Type: Journal Article
• Authors: Klimošová, Tereza; Piguet, Diana; Rozhoň, Václav
• Is Part Of: European journal of combinatorics. Volume 88(2020)
• Publication Date: 2020-08
• Subjects: Combinatorial analysis -- Periodicals; Analyse combinatoire -- Périodiques; Combinatorial analysis; Periodicals; Electronic journals; 511.6
• DOI: 10.1016/j.ejc.2020.103106
• Languages: English
• ISSNs: 0195-6698

Abstract

Abstract: Loebl, Komlós, and Sós conjectured that any graph with at least half of its vertices of degree at least k contains every tree with at most k edges. We propose a version of this conjecture for skew trees, i.e., we consider the class of trees with at most k edges such that the sizes of the colour classes of the trees have a given ratio. We show that our conjecture is asymptotically correct for dense graphs. The proof relies on the regularity method. Our result implies bounds on Ramsey number of several trees of given skew.