6 citations · 6 across the 3 of their papers we have counts for
1 paper · 1 filter
Jan Hladký, János Komlós, Diana Piguet +3
We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha…